题目描述：
LeetCode 746. Min Cost Climbing Stairs
On a staircase, the i-th step has some non-negative cost cost[i] assigned (0 indexed).
Once you pay the cost, you can either climb one or two steps. You need to find ...
标签归档：leetcode
[LeetCode]Min Cost Climbing Stairs
[LeetCode]Prefix and Suffix Search
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 745. Prefix and Suffix Search
Given many words, words[i] has weight i.
Design a class WordFilter that supports one function, WordFilter.f(String prefix, String suffix). It will return the word with given prefix and suffix with ...
[LeetCode]Closest Leaf in a Binary Tree
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 742. Closest Leaf in a Binary Tree
Given a binary tree where every node has a unique value, and a target key k, find the closest leaf node to target k in the tree.
A node is called ...
[LeetCode]Network Delay Time
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 743. Network Delay Time
There are N network nodes, labelled 1 to N.
Given times, a list of travel times as directed edges times[i] = (u, v, w), where u is the source node, v is the target ...
[LeetCode]Find Smallest Letter Greater Than Target
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 744. Find Smallest Letter Greater Than Target
Given a list of sorted characters letters containing only lowercase letters, and given a target letter target, find the smallest element in the list that is larger than the given target ...