parent
6fb61ead0b
commit
c0f1f13669
|
|
@ -126,6 +126,7 @@ 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)):
|
||||||
|
if i <= cover:
|
||||||
cover = max(i + nums[i], cover)
|
cover = max(i + nums[i], cover)
|
||||||
if cover >= len(nums) - 1: return True
|
if cover >= len(nums) - 1: return True
|
||||||
return False
|
return False
|
||||||
|
|
|
||||||
Loading…
Reference in New Issue