题目描述
题目难度:Medium
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.
AC代码
从后往前依次遍历每个元素是否可以到达, …A…B…C…,若A可以到C,那么A一定可以到B。
class Solution {
public boolean canJump(int[] nums) {
if(nums == null || nums.length == 0) return true;
int len = nums.length;
int canArrival = len - 1;
for(int i = len - 2; i >= 0;i--){
if(i + nums[i] >= canArrival) canArrival = i;
}
return canArrival == 0;
}
}