LeetCode Jump Game II
发布时间：2020-12-13 20:04:32 所属栏目：PHP教程 来源：网络整理
导读：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. Your goal is to reach the last index in the minimum numbe
|
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. Your goal is to reach the last index in the minimum number of jumps.
For example:
The minimum number of jumps to reach the last index is 思路：用Max表示[0,i⑴]能到达的最远距离，cur表示用ans步到达的距离。那末如果cur<i的话，代表它需要再走1步，所以它就能够到达前i⑴能到达的最远距离，可以这么想Max1定是某个位置起跳的，而cur也1定是大于等于Max的起始位置的，由于每一个位置的是都是非负数，所以cur1定是>=Max的起始位置的，可以动手写写。 class Solution {
public:
int jump(int A[],int n) {
int ans = 0,Max = 0,cur = 0;
for (int i = 0; i < n; i++) {
if (cur >= n⑴) break;
if (cur < i) {
ans++;
cur = Max;
}
Max = max(Max,A[i]+i);
}
return ans;
}
};
（编辑：李大同） 【声明】本站内容均来自网络，其相关言论仅代表作者个人观点，不代表本站立场。若无意侵犯到您的权利，请及时与联系站长删除相关内容! |