[LeetCode]Jump Game@Python

最新推荐文章于 2024-04-19 11:01:49 发布

Goofiness

最新推荐文章于 2024-04-19 11:01:49 发布

阅读量160

点赞数

CC 4.0 BY-SA版权

分类专栏： leetcode greedy 文章标签： leetcode python

本文链接：https://blog.youkuaiyun.com/byr_wy/article/details/91410177

leetcode 同时被 2 个专栏收录

232 篇文章

订阅专栏

greedy

15 篇文章

订阅专栏

本文深入解析JumpGame算法问题，给出了一种有效的解决方案。通过寻找最优局部结果，算法判断能否从数组起始位置达到最后一个元素。示例展示了如何利用最大跳跃长度实现目标。

Jump Game

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

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

Solution

# key is to find out a right algorithm to calculate the best local result
class Solution(object):
    def canJump(self, nums):
            m = 0
            i = 0
            while (m < len(nums)-1):
                if i > m:
                    return False
                m = max(m, i+nums[i])
                i += 1
            return True