【leetcode】(python)45. Jump GameII 跳跃游戏II

45. Jump Game II Hard

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.

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.

题意

从数组的第一个位置用最少的次数跳到数组的最后一个位置，数组每个位置上的数字是每次可跳跃的最大步数。

贪心算法

这题延续55.Jump Game 的思路，然后这题题意应该是所有的数组都是可到达的。只不过加了step, step代表每次实际跳跃到的位置索引，每跳一次结果+1，到达最后位置时就是跳的结果次数。

python code

class Solution:
    def jump(self, nums: List[int]) -> int:
        if len(nums)<=1:
            return 0
        step, index = 0, 0
        res = 0
        for i , num in enumerate(nums):
            if i > step:
                step = index
                res += 1
                if step >= len(nums) -1:
                    break
            index = max(index, i+nums[i])
        return res

or

class Solution:
    def jump(self, nums: List[int]) -> int:
        n = len(nums)
        farthest = 0
        step = 0
        end = 0
        for i in range(n-1):
            farthest = max(farthest,nums[i]+i)
            if end == i:
                step += 1
                end = farthest
        return step