leetcode | 45. 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:

Input: [2,3,1,1,4]
Output: 2
Explanation: 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.

思路与解法

题目要求我们找到最少的步骤到达列表末尾，我们可以采用动态的思想：dp[i]表示到大索引i时所需的最少步骤。则状态转移方程为：

dp[i] = min(dp[i], dp[i-1]+1)

在计算得到dp[i]之后，我们需要更新位置i所能到达的所有后续位置的步骤数。

for j=i+1; j<=i+nums[i]; j++ {
	dp[j] = min(dp[j], dp[i]+1)
}

代码实现

const INT_MAX = int(^uint(0) >> 1)
// 自定义函数返回a，b中的较小值
func min(a, b int) int {
    if a < b {
        return a
    }
    return b
}
func jump(nums []int) int {
    length := len(nums)
    dp := make([]int, length)
    // 可以从位置0直接到达的位置初始化为1，不可到达的位置的初始化为无限大
    for i:=1; i<length; i++ {
        if i <= nums[0] {
            dp[i] = 1
        } else {
            dp[i] = INT_MAX
        }
    }
    for i:=1; i<length; i++ {
        dp[i] = min(dp[i], dp[i-1] + 1)
        for j:=1; j<= nums[i]; j++ {
            if i+j >= length {
                break
            }
            dp[i+j] = min(dp[i+j], dp[i] + 1)
        }
    }
    return dp[length-1]
}

运行结果