Problem
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.
Solutions
1.Greedy
The best idea is to use greedy method. I will maintain an integer to save the farest reachable position at every position. Firstly, I will check whether this position can we reach now, if we can’t, we should return false. If we can reach this position, we check weather this position can reach the end of the array. If it can we return true
class Solution {
public boolean canJump(int[] nums) {
if(nums.length == 1) return true;
int farest = 0;
for(int i = 0; i <= farest; i++){
farest = Math.max(farest, i + nums[i]);
if(i + nums[i] >= nums.length - 1) return true;
}
return false;
}
}