三天一题-37-Jump Game

题目地址：Jump Game
Given an array of non-negative integers, you are initially positioned at the first index of the array.
Each element in the array represents your maximum jump length at that position.
Determine if you are able to reach the last index.
Example 1:
Input: [2,3,1,1,4]
Output: true
Explanation: Jump 1 step from index 0 to 1, then 3 steps to the last index.
Example 2:
Input: [3,2,1,0,4]
Output: false
Explanation: You will always arrive at index 3 no matter what. Its maximum
jump length is 0, which makes it impossible to reach the last index.

import java.util.ArrayList;

class CanJump {
    public static void main(String[] args) {
        int[] input = {4, 3, 2, 1, 0, 1};
        boolean res = canJump(input);
        System.out.println(res);
    }

    public static boolean canJump(int[] nums) {
        ArrayList<Integer> breakSpots = new ArrayList<>();
        for (int i = 0; i < nums.length; i++) {
            if (0 == nums[i]) {
                breakSpots.add(i);
            }
        }
        if (breakSpots.size() != 0) {
            for (int i = breakSpots.size() - 1; i > -1; i--) {
                int count = 1;
                int index = breakSpots.get(i) - 1;
                while (nums[index] < count + 1) {
                    if (index == 0) return false;
                    count++;
                    index--;
                }
            }
        }
        return true;
    }
    //推荐：满足条件的数值都须满足 间距>位置上数值即 j-i>A[i]，变换位置就是j>A[i]+i;（此答案参考https://leetcode.com/problems/jump-game/discuss/20923/Java-Solution-easy-to-understand）
    public static boolean canJump1(int[] A) {
        int max = 0;
        for(int i=0;i<A.length;i++){
            if(i>max) {return false;}
            max = Math.max(A[i]+i,max);
        }
        return true;
    }
}