161. Leetcode 55. 跳跃游戏 (贪心算法-贪心区间)

1.  
   class Solution:
2.  
   def canJump(self, nums: List[int]) -> bool:
3.  
   if len(nums) == 1:return True
4.  
   cover = 0
5.  
   i = 0
6.  
   while i <= cover:
7.  
   cover = max(i nums[i], cover)
8.  
   if cover >= len(nums) - 1:
9.  
   return True
10.  
    i = 1
11.  
     
12.  
    return False

这篇好文章是转载于：学新通技术网