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:
Given array A = [2,3,1,1,4]
The minimum number of jumps to reach the last index is 2
. (Jump 1
step from index 0 to 1, then 3
steps to the last index.)
思路:每次以上一次能达到的最大范围内找一个新的最大范围(A[i] + i),作为下一次能走的最大范围,直到数组尾部。
class Solution {
public:
int jump(int A[], int n) {
if(n == 1) return 0;
int lastmax = A[0];
int nextmax = 0;
int cnt = 1;
for(int i = 1;i < n;i ++){
if(lastmax < i){
cnt ++;
lastmax = nextmax ;
}
nextmax = max(nextmax ,A[i] + i);
}
return cnt;
}
};