45. Jump Game II leetcode python 2016 new season

最新推荐文章于 2024-04-23 09:28:05 发布

原创最新推荐文章于 2024-04-23 09:28:05 发布 · 737 阅读

0 ·

CC 4.0 BY-SA版权

leetcode 同时被 2 个专栏收录

166 篇文章

订阅专栏

2016刷题

45 篇文章

订阅专栏

解释了如何通过遍历数组并使用跳跃算法找到从数组第一个元素到最后一个元素的最短路径，通过优化跳跃范围来减少跳跃次数。

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

Show Tags

Have you met this question in a real interview?

Yes

Discuss

class Solution(object):
    def jump(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        count = 0
        last = 0 
        reach = 0
        for i in range(len(nums)):
            if i > last:
                last = reach
                count += 1
            reach = max(reach, i + nums[i])
        return count