leetcode55.跳跃游戏 贪心算法

class Solution: def canJump(self, nums: List[int]) -> bool: optim,optim_index,i=0,0,0 while i<=len(nums)-1: optim=i+nums[i] if optim>=len(nums)-1: return True if optim==i: return False i=optim_index f

>>阅读原文<<