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.
一层循环找到可以reach的最大边界,最后判断reach和nums.size()-1的大小,返回最终结果。代码如下:
class Solution {
public:
bool canJump(vector<int>& nums) {
if(nums.empty())
return false;
int reach = 0;
for(int i = 0; i <= reach && i < nums.size()-1; ++i) { //只需要遍历到倒数第二个数
reach = max(reach, nums[i] + i);
}
if(reach >= nums.size() - 1)
return true;
return false;
}
};