#55 Jump Game——Top 100 Liked Questions

最新推荐文章于 2023-08-17 10:51:23 发布

sxjjxc

最新推荐文章于 2023-08-17 10:51:23 发布

阅读量118

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode

本文链接：https://blog.youkuaiyun.com/suixuejie/article/details/90345169

LeetCode 专栏收录该内容

34 篇文章

订阅专栏

博客围绕跳跃游戏问题展开，给定非负整数数组，数组元素代表最大跳跃长度，需判断能否到达最后索引。提出通过计算 num[i]+i 得到 i 位置能到达的最大距离，遍历后若最大距离小于数组长度减 1 则不能到达末尾，反之则能到达，同时要避免元素为零的特例。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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.

Determine if you are able to reach the last index.

Example 1:

Input: [2,3,1,1,4]
Output: true
Explanation: Jump 1 step from index 0 to 1, then 3 steps to the last index.

Example 2:

Input: [3,2,1,0,4]
Output: false
Explanation: You will always arrive at index 3 no matter what. Its maximum
             jump length is 0, which makes it impossible to reach the last index.

"""
第一次：num[i]+i为i位置所等到达的最大距离，遍历后如果最大距离小于L-1，说明不能到达末尾，如果>=L-1，说明肯定能到达末尾。同时在每次遍历时，应使dist>=i，这是为了避免元素为零的特例
"""
class Solution(object):
    def canJump(self, nums):
        """
        :type nums: List[int]
        :rtype: bool
        """
        L = len(nums)
        dist = 0
        for i in range(L-1):
            if dist >= i:
                dist = max(dist, i + nums[i])
        if dist < L - 1:
            return False
        return True
"""

Runtime: 72 ms, faster than 58.03% of Python online submissions for Jump Game.

Memory Usage: 13.3 MB, less than 33.52% of Python online submissions for Jump Game.

"""