- 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.
python:
class Solution:
def canJump(self, nums: List[int]) -> bool:
step = nums[0]
if not step and len(nums)>1:
return False
for i in range(1,len(nums)-1):
step = max(step-1,nums[i])
if not step:
return False
return True
tips:
这里只需要判断到倒数第二个是否步数大于0,最后一个不用判断
java:
class Solution {
public boolean canJump(int[] nums) {
int step = nums[0];
if(step == 0 && nums.length>1)
return false;
for(int i = 0;i<nums.length-1;i++){
step = Math.max(step-1,nums[i]);
if(step<=0)
return false;
}
return true;
}
}