代码:
class Solution {
public boolean canJump(int[] nums) {
int n = nums.length;
int max = 0;
int curmax = nums[0];
int i=0;
for(;i<=max;i++){
if(i==n)break;
curmax = Math.max(curmax,i+nums[i]);
if(i==max){
max = curmax;
}
}
if(max>=n-1)return true;
else return false;
}
}