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.

Your goal is to reach the last index in the minimum number of jumps.

Have you met this question in a real interview? Yes
Example
Given array A 
 
= [2,3,1,1,4]

The minimum number of jumps to reach the last index is 2. (Jump 1 step from index 0 to 1, 
then 3 steps to the last index.)

巧用 Integer.MAX_VALUE;來替換 true

public int jump(int[] A) {
        // write your code here
        //state
        int[] can = new int[A.length];
       
        //initialize
        can[0] = 0;
        
        //function
        for (int i = 1; i < A.length; i++) {
            can[i] = Integer.MAX_VALUE;
            for (int j = 0; j < i; j++) {
                if (can[j] != Integer.MAX_VALUE && j + A[j] >= i) {
                    can[i] = can[j] + 1 > can[i] ? can[i] : can[j] + 1;
                }
                }
        }
        return can[A.length - 1];
    }

Jump Game II