parent
6fb61ead0b
commit
c0f1f13669
|
|
@ -126,8 +126,9 @@ class Solution:
|
|||
cover = 0
|
||||
if len(nums) == 1: return True
|
||||
for i in range(len(nums)):
|
||||
cover = max(i + nums[i], cover)
|
||||
if cover >= len(nums) - 1: return True
|
||||
if i <= cover:
|
||||
cover = max(i + nums[i], cover)
|
||||
if cover >= len(nums) - 1: return True
|
||||
return False
|
||||
```
|
||||
|
||||
|
|
|
|||
Loading…
Reference in New Issue