LeetCode-45 Jump Game II

Description

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.

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

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.

Submissions

这道题的解题思路是设定一个边界，看看其中哪个位置可以跳的最远。boudary代表当前点可以跳到的最远边界， auxiliary_length代表当前与boudary之间的点可以跳的最远的点位置，step代表跳的步数。

实现代码如下：

class Solution:
    def jump(self, nums: List[int]) -> int:
        length = len(nums)
        if length <= 1:
            return 0
        boudary = 0
        auxiliary_length = 0
        step = 0
        for index in range(length):
            auxiliary_length = max(auxiliary_length, nums[index] + index)
            if index == boudary:
                boudary = auxiliary_length
                step += 1
            if boudary == length - 1:
                break
        return step

参考