题目
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.
思路
一开始用了动态规划,用一个数组,存储从该下标处能不能跳到终点。
优化:
只用一个数记录目标终点。当 从 i 可以跳到终点,那么我们可以把 i 看作前面格子的终点。
def canJump(self, nums: List[int]) -> bool:
end = len(nums)-1
for i in range(len(nums)-1,-1,-1):
if nums[i] >= end-i:
end = i
if end == 0:
return True
else:
return False