class Solution{
public:
bool canJump(int A[], int n){
int ll = 0, rr = 0;
while(ll <= rr){
int f = ll + A[ll];
if(f >= n - 1){
return true;
}
rr = max(rr, f);
if(ll < rr){
ll++;
}
else{
break;
}
}
return false;
}
};
转载于:https://my.oschina.net/u/1421373/blog/379588