leetcode: 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 is2. (Jump1step from index 0 to 1, then3steps to the last index.)

解题思路：

1. 这道题与上一题不同的地方在于返回走到末尾节点最少的步数
2. 可以用动态规划来求解

代码如下：

    public int jump(int[] A) {
        int[] dp = new int[A.length ];

        for(int i = 0; i < dp.length; i++){
		
	    // 当前元素可到达的最远位置
            int maxPosition = Math.min(i + A[i], A.length  -1);
            for(int j = i + 1; j <= maxPosition; j++){
			
		// 依次设置 dp 数组的值，若当前位置没有被访问，那么它的值就在 i 的基础上多走了一步
                if(dp[j] == 0) dp[j] = dp[i] + 1;
            }
            if(dp[A.length - 1] != 0) break;
        }
        return dp[A.length - 1];
    }

转载于:https://my.oschina.net/happywe/blog/3086428