问题描述:
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大于等于(数组的长度-1),则return true,否则完成遍历后,return false。
具体代码实现:
bool canJump(vector<int>& nums) {
int n = nums.size();
int i = 0, reach = 0;
for (; i < n&&i <= reach; i++) {
reach = max(i + nums[i], reach);
if (reach >= n - 1) {
return true;
}
}
return false;
}