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.
Constraints:
- \[1 <= nums.length <= 3 * 10^4\]
- \[0 <= nums[i][j] <= 10^5\]
Example:
Input: nums = [2,3,1,1,4]
Output: true
Explanation: Jump 1 step from index 0 to 1, then 3 steps to the last index.
Input: nums = [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.
Thoughts
- 类似LC45，但更简单
- 使用
jumpable来表示当前可以跳到的最远距离 - 如果
i > jumpable证明跳不到i，return false - 如果
n-1 <= jumpable证明已经可以跳到最后，return true
Code(JAVA)
public boolean canJump(int[] nums) {
int jumpable = 0;
for(int i = 0; i < nums.length; i++) {
if(i > jumpable)
return false;
jumpable = Math.max(jumpable,i+nums[i]);
if(jumpable >= nums.length-1)
return true;
}
return false;
}
