class Solution:
def canJump(self, nums: List[int]) -> bool:
n = len(nums)
right_most = n - 1
for i in range(n - 2, -1, -1):
if i + nums[i] >= right_most:
right_most = i
return right_most == 0
Leetcode_Dynamic Programming_Jump Game
猜你喜欢
转载自blog.csdn.net/weixin_45405128/article/details/105353490
今日推荐
周排行