45. 跳跃游戏 II

https://leetcode-cn.com/problems/jump-game-ii/ 

class Solution {
    public int jump(int[] nums) {
        //终点
        int index = nums.length - 1;
        int step = 0;
        while (index > 0) {
            //从左到右寻找能够一步到达终点的这个点
            for (int i = 0; i < index; i++) {
                if (i + nums[i] >= index) {
                    step++;
                    index = i;
                }
            }
        }
        return step;
    }
    //public static void main(String[] args) {
    //    System.out.println(new Solution().jump(new int[]{2, 3, 1, 1, 4}));// 2
    //    System.out.println(new Solution().jump(new int[]{1, 1, 1, 1, 1}));// 4
    //    System.out.println(new Solution().jump(new int[]{1, 2, 1, 1, 1}));// 3
    //    System.out.println(new Solution().jump(new int[]{1, 10, 1, 1, 1}));// 2
    //    System.out.println(new Solution().jump(new int[]{10, 1, 1, 1, 1}));// 1
    //}
}