algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-09 02:53:31 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update 0055.跳跃游戏.md

Browse Source 
python for循环版，添加了更新cover的条件
This commit is contained in:
roylx
2022-11-15 11:05:39 -07:00
committed by GitHub
parent 6fb61ead0b
commit c0f1f13669
1 changed files with 3 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

5
problems/0055.跳跃游戏.md
View File

@ -126,8 +126,9 @@ class Solution:
cover = 0 cover = 0
if len(nums) == 1: return True if len(nums) == 1: return True
for i in range(len(nums)): for i in range(len(nums)):
cover = max(i + nums[i], cover) if i <= cover:
if cover >= len(nums) - 1: return True cover = max(i + nums[i], cover)
if cover >= len(nums) - 1: return True
return False return False
``` ```