[leetcode]Jump Game @ Python

最新推荐文章于 2025-09-06 22:33:46 发布

weixin_34233856

最新推荐文章于 2025-09-06 22:33:46 发布

阅读量73

点赞数

文章标签：数据结构与算法 python

本文解析了一种名为“跳远游戏”的算法问题，探讨了如何判断能否从数组起始位置到达最后一个元素的方法。通过实现一个名为canJump的函数，利用递减步数策略解决了这一问题。

原题地址：https://oj.leetcode.com/problems/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.

For example:
A = [2,3,1,1,4], return true.

A = [3,2,1,0,4], return false.

代码：

class Solution:
    # @param A, a list of integers
    # @return a boolean
    def canJump(self, A):
        step = A[0]
        for i in range(1, len(A)):
            if step > 0:
                step -= 1
                step = max(step, A[i])
            else:
                return False
        return True