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.)
一直往后遍历,得到当前step能到达的最远距离max,直到max>=A.length-1
public class Solution {
public int jump(int[] A) {
int max = 0;
int step = 0;
int pre = 0;
while(max<A.length-1){
int temp = max;
step++;
for(int i=pre;i<=max;i++){
if(A[i]+i>temp){
temp=A[i]+i;
pre = i+1;
}
}
max = temp;
}
return step;
}
}