lintcode ----跳跃游戏

bool canJump(vector<int> A) {
// write you code here

vector<int> res;
res.push_back(A[0]);
for(int i=1;i<A.size();i++)
{
if(res[i-1]>=i)
res.push_back(max(A[i]+i,res[i-1]));
else
res.push_back(0);
}
return res[res.size()-1]>=A.size()-1;

}

bool canJump(vector<int> A) {
// write you code here

int max_gap =0;
int cur = 0;
while(max_gap>=cur)
{
max_gap=max(max_gap,cur+A[cur]);
cur++;
if(max_gap>=A.size()-1)
return true;
}
return false;

}