Jump Game(fromLeecode
题意:
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(vector<int>& nums) {
int lastjump = 0;
int thisjump = 0;
int sum = 0;
for(int i=0;i<nums.size();i++){
if(i>lastjump){
lastjump = thisjump;
sum++;
}
if(i>thisjump){
return 0;
}
if(i==nums.size()-1){
return 1;
}
thisjump = max(thisjump,i+nums[i]);
}
}
};