题目
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.
题目分析
这道题类似于跳棋,结果是返回一个能否到底end。因为该步与前一步紧密联系,因此采用DP思想。
用变量far记录跳棋能跳到最远的距离
1. 如果当前可跳最长等于0,且能跳到的最远距离小于等于该位置,那么认为跳棋不能跨越该位置,如果该位置恰巧为end,则返回true,否则就返回false
2. 动态记录可以可以跳到的最远距离
源代码
class Solution {
public:
bool canJump(vector<int>& nums) {
// DP
//vector<bool> dp(nums.size(), false);
//dp[0] = true;
int far = 0;
for (int i = 0; i < nums.size(); i++) {
if (nums[i] == 0 && far <= i && i != nums.size() - 1) {
return false;
} else {
far = max(far, nums[i] + i);
}
}
return true;
}
};