【leetcode】45. Jump Game II
网址
题目
解法
- 较容易
class Solution {
public int jump(int[] nums) {
if(nums.length < 2) return 0;
int index = 0, count = 0;
while(index < nums.length){
int max = 0;
int max_index = -1;
for(int i = index + 1; i <= index + nums[index]; i++){
if(i == nums.length - 1){
return count + 1;
}else if(i + nums[i] > max){
max_index = i;
max = i + nums[i];
}
}
System.out.println(max_index);
index = max_index;
count++;
}
return count + 1;
}
}