贪婪算法
class Solution:
def jump(self, nums: List[int]) -> int:
end = 0
step = 0
boundary = 0
for i in range(len(nums)-1):
boundary = max(boundary, nums[i] + i)
if end == i:
end = boundary
step += 1
return step