[LeetCode]Jump Game@python

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

.

思路：遍历数组，维护一个跳跃最大值，如果当前值大于等于最大值，更新，否则原最大值-1

class Solution(object):
def canJump(self, nums):
"""
:type nums: List[int]
:rtype: bool
"""
max_num = 0
for i in range(len(nums)):
if nums[i] >= max_num:
max_num = nums[i]
else:
max_num -= 1
if max_num == 0 and i != len(nums)-1:
return False
return True