Jump Game II

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.

For 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.)

Note:
You can assume that you can always reach the last index.

思路：贪心，有个概念必须更正，nums[i] 代表的 是可以jump的最大距离，也就是这中间的点也是可以jump到的，所以是一个层级搜索的概念；[curBegin, CurEnd] ,搜集目前的maxReach，如果i走到了CurEnd 代表走完一层，curEnd = maxReach ,step++，搜下一层；注意只用搜到倒数第二个，因为目标是最后一个position，always reach last position;

class Solution {
    public int jump(int[] nums) {
        if(nums == null || nums.length == 0) {
            return 0;
        }
        int step = 0, curEnd = 0, maxReach = 0;
        for(int i = 0; i < nums.length - 1; i++) {
            maxReach = Math.max(maxReach, nums[i] + i);
            if(i == curEnd) {
                curEnd = maxReach;
                step++;
            }
        }
        return step;
    }
}

DP O(N^2); 

class Solution {
    public int jump(int[] nums) {
        if(nums == null || nums.length == 0) {
            return 0;
        }
        int n = nums.length;
        boolean[] canReach = new boolean[n];
        int[] dp = new int[n];
        dp[0] = 0;
        for(int i = 1; i < n; i++) {
            dp[i] = Integer.MAX_VALUE;
        }
        canReach[0] = true;
        
        for(int i = 1; i < n; i++) {
            for(int j = 0; j < i; j++) {
                if(canReach[j] && nums[j] + j >= i) {
                    canReach[i] = true;
                    dp[i] = Math.min(dp[i], dp[j] + 1);
                }
            }
        }
        return canReach[n - 1] ? dp[n - 1] : 0;
    }
}