class Solution {
public:
int jump(vector<int>& nums) {
int n = nums.size();
if (n == 1)
return0;
for (int i=0;i<n;i++){
nums[i] = i + nums[i];
}
int pre = 0;
int pos = 0;
for (int i=1;i<n;i++){
int p = nums[pos];
if (p >= n-1)
return i;
int tmp = 0;
for (int j=pre+1; j<=p;j++){
if (nums[j] > tmp){
tmp = nums[j];
pos = j;
}
}
pre = p;
}
return -1;
}
};
优先队列优化dp
class Solution {
public:
int jump(vector<int>& nums) {
priority_queue<int> q;
int n = nums.size();
if (n == 1)
return0;
for (int i=0;i<n;i++){
nums[i] = i + nums[i];
}
q.push(nums[0]);
int pre = 0;
for (int i=0;i<n;i++){
auto tmp = q.top();
q.pop();
if (tmp >= n-1)
return i+1;
for (int j=pre+1;j<=tmp;j++){
q.push(nums[j]);
}
pre = tmp;
}
return -1;
}
};
普通dp(T了。。)
class Solution {
public:
int jump(vector<int>& nums) {
int n = nums.size();
vector<int> dp(n, 0x3f3f3f3f);
dp[0] = 0;
for (int i=1;i<n;i++){
for (int j=0;j<i;j++){
if (nums[j] + j >= i){
dp[i] = min(dp[i], dp[j] + 1);
}
}
}
return dp[n-1];
}
};
A*搜索(T了。。)
class Solution {
public:
int jump(vector<int>& nums) {
priority_queue<pair<int,int>, vector<pair<int,int> >, greater<pair<int,int> > > q;
int n = nums.size();
if (n == 1)
return0;
vector<bool> mark(n, 0);
q.push(make_pair(0, 0));
mark[0] = 1;
while (q.size()){
auto tmp = q.top();
q.pop();
int pos = tmp.second;
for (int i=1;i<=nums[pos];i++){
if (i+pos == n-1)
return tmp.first + 1;
if (mark[i+pos])
continue;
q.push(make_pair(tmp.first+1, i+pos));
mark[i+pos] = 1;
}
}
return -2;
}
};