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.
For example:
A = [2,3,1,1,4]
, return true
.
A = [3,2,1,0,4]
, return false
.
class Solution {
public:
/*能到达最终点,则必能到达之前的所有点。否则有断点,则不能达到最重点*/
bool canJump(int A[], int n) {
if(n<=0) return true;
int max=A[0];
for(int i=1;i<n;i++){
if(max<i) return false;
if((i+A[i])>max){
max=i+A[i];
}
}
return max>=(n-1);
}
};
还有使用动态规划方法来做,canStillWalk[i]表示,到达i还剩下多少步可以走。
class Solution {
public:
bool canJump(int A[], int n) {
if(n <= 1) return true;
if(A[0] >= (n-1)) return true;
int *canStillWalk = new int[n];
canStillWalk[0] = A[0];
for(int i = 1; i < n; ++i){
canStillWalk[i] = max(canStillWalk[i-1], A[i-1]) - 1;
if(canStillWalk[i] < 0) return false;
}
return canStillWalk[n-1] >= 0;
}
};