问题描述:
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.
Example 1:
Input: [2,3,1,1,4] Output: true Explanation: Jump 1 step from index 0 to 1, then 3 steps to the last index.
Example 2:
Input: [3,2,1,0,4] Output: false Explanation: You will always arrive at index 3 no matter what. Its maximum jump length is 0, which makes it impossible to reach the last index.
源码:
第一次,超时,时间复杂度O(n^2)。
用一个result向量表示这个位置能否到达。
比如:
[2,3,1,1,4]
首先result[0]等于true,因为nums[0]等于2,所以result[1:2]=true,这样一直找下去。
class Solution {
public:
bool canJump(vector<int>& nums) {
int n = nums.size();
if(n==0) return true;
vector<bool> result(n, false);
result[0] = true;
for(int i=0; i<n; i++){
if(result[i]){
for(int j=i+1; j<=i+nums[i]; j++)
result[j] = true;
}
}
// cout<<result[0]<<result[1]<<result[2]<<result[3]<<result[4]<<endl;
return result[n-1];
}
};
第二次:设置一个last,表示当前已经能跳到的最大位置,比如(同样是上一个例子)result[0]的时候已经将result[2]设置为true,那么后面就不用再次设置他,用last记录这个位置2。这样可以将时间复杂度降到很低。
class Solution {
public:
bool canJump(vector<int>& nums) {
int n = nums.size();
if(n==0) return true;
vector<bool> result(n, false);
result[0] = true;
int last = 0;
for(int i=0; i<n; i++){
if(result[i]){
if(i+nums[i]>last){
for(int j=last; j<=i+nums[i]; j++){
result[j] = true;
}
last = i+ nums[i];
}
// last = last>i+nums[i]? last, nums[i];
}
}
// cout<<result[0]<<result[1]<<result[2]<<result[3]<<result[4]<<endl;
return result[n-1];
}
};