day23笔记
1.题目描述
2.代码构思(debug)
class Solution:
def canJump(self, nums: List[int]) -> bool:
if not nums:
return
len1 = len(nums)
if 0 not in nums:
return True
rightmost = 0
result = False
for i in range(len1):
if i <= rightmost:
rightmost = max(rightmost,i + nums[i])
if rightmost >= len1 - 1:
result = True
break
return result
class Solution:
def jump(self, nums: List[int]) -> int:
if not nums:
return
n = len(nums)
maxPos, end, step = 0, 0, 0
for i in range(n - 1):
if maxPos >= i:
maxPos = max(maxPos, i + nums[i])
if i == end:
end = maxPos
step += 1
return step```