[刷题]Jump Game II

[LintCode]Jump Game II

public class Solution {
    /**
     * @param A: A list of lists of integers
     * @return: An integer
     */
    public int jump(int[] A) {
        // 2015-05-15
        if (A == null || A.length == 0) {
            return 0;
        }
        int n = A.length;
        int[] min = new int[n];
        min[0] = 0;
        for (int i = 1; i < n; i++) {
            min[i] = Integer.MAX_VALUE;
            for (int j = 0; j < i; j++) {
                if (min[j] != Integer.MAX_VALUE && j + A[j] >= i) {
                    min[i] = Math.min(min[i], min[j] + 1);
                }
            }
        }
        return min[n - 1];
    }
}