public class Solution {
public boolean canJump(int[] A) {
int [] state = new int[A.length];
state[0] = A[0];
if (state[0]==0 && A.length>1) return false;
for (int i=1; i<A.length; i++) {
state[i] = Math.max(state[i-1], A[i]+i);
if (state[i]==i && i!=A.length-1) return false;
}
return true;
}
}
没有评论:
发表评论