- 分类：Greedy
- 时间复杂度: O(n)
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:
Input: [2,3,1,1,4]
Output: true
Explanation: Jump 1 step from index 0 to 1, then 3 steps to the last index.
Example 2:
Input: [3,2,1,0,4]
Output: false
Explanation: You will always arrive at index 3 no matter what. Its maximum
jump length is 0, which makes it impossible to reach the last index.
代码：
方法:
class Solution:
def canJump(self, nums):
"""
:type nums: List[int]
:rtype: bool
"""
distance=0
length=len(nums)
i=0
while(i<=distance and i<length):
distance=max(distance,i+nums[i])
if distance>=length-1:
return True
i+=1
return False
讨论：
1.挺简单的贪心算法题= 。=
2.注意边界，注意边界，注意边界，重要的事情说三遍
