原题链接:力扣
class Solution {
public int jump(int[] nums) {
if(nums.length==1){
return 0;
}
int count=1;
for(int i=0;i<nums.length;i++){
if(i+nums[i]>=nums.length-1){
return count;
}
int r=i+1;
for(int j=i+1;j<=nums[i]+i;j++){
if(j+nums[j]>nums[r]+r){
r=j;
}
}
i=r-1;
count++;
}
return count;
}
}