class Solution:
def jump(self, nums: List[int]) -> int:
fn = [len(nums) + 1] * len(nums)
fn[0] = 0
for i in range(len(nums)):
for j in range(1, nums[i]+1, 1):
if (i + j >= len(nums)):
return fn[-1]
fn[i + j] = min(fn[i+j], fn[i] + 1)
return fn[-1]
#45. 跳跃游戏 II
最新推荐文章于 2022-12-15 14:45:00 发布