本题目对应LeetCode第45题 跳跃游戏②
思路:贪心算法或者DFS
代码参考了力扣题解
import java.util.*;
public class Q3 {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int number = sc.nextInt();
int[] a = new int[number];
for(int i = 0; i < number; i++) {
a[i] = sc.nextInt();
}
System.out.println(jump(a));
}
public static int jump(int[] nums) {
int position = nums.length -1;
int steps = 0;
while(position >0){
for(int i = 0; i < position; i++) {
if(i + nums[i] >= position) {
position = i;
steps++;
break;
}
}
}
return steps;
}
}