class Solution {
public int jump(int[] nums) {
int n = nums.length;
if(n == 1){
return 0;
}
int max = nums[0];
if(max >= n - 1){
return 1;
}
int temp = max;
int count = 1;
for(int i = 1;i <= max;i++){
temp = Math.max(temp,i + nums[i]);
if(i == max){
max = temp;
count++;
}
if(max >= n - 1){
break;
}
}
return count;
}
}
力扣跳跃游戏,贪心
最新推荐文章于 2024-07-08 20:34:53 发布