贪心
木头不是哑巴
这个作者很懒,什么都没留下…
展开
-
55. Jump Game
Given an array of non-negative integers, you are initially positioned at the first index of the array. Each element in the array represents your maximum jump length at that position. Determine if you are able to reach the last index. Example 1: Inp.转载 2020-07-04 12:41:30 · 136 阅读 · 0 评论 -
Leetcode 310. Minimum Height Trees
For an undirected graph with tree characteristics, we can choose any node as the root. The result graph is then a rooted tree. Among all possible rooted trees, those with minimum height are called min...转载 2019-12-22 16:28:23 · 99 阅读 · 0 评论