[LintCode]117. Jump Game II

[LintCode]117. 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.

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

public class Solution {
    /**
     * @param A: A list of integers
     * @return: An integer
     */
    public int jump(int[] A) {
        // 每一个数字代表站在这里最多能跳多少步
        // 最少要多少步能跳到最后一个
        if(A == null || A.length <= 0) return 0;
        int[] dp = new int[A.length];
        dp[0] = 0;
        for(int i = 1; i < A.length; i++) {
            dp[i] = Integer.MAX_VALUE;
            for(int j = 0; j < i; j++) {
                if(j + A[j] >= i) {
                    dp[i] = Math.min(dp[i], dp[j]+1);
                }
            }
        }
        return dp[A.length-1];
    }
}

posted on 2019-01-16 12:05 9042 阅读( ...) 评论( ...) 编辑 收藏

转载于:https://www.cnblogs.com/lawrenceSeattle/p/10276304.html