用dp可以做,就是太慢,擦边通过
class Solution:
def jump(self, nums: List[int]) -> int:
dp = [10000]*len(nums)
dp[0] = 0
for i in range(len(nums)-1):
for j in range(1,nums[i]+1):
if i+j>=len(nums):
return dp[-1]
else:
dp[i+j] = min(dp[i+j],dp[i]+1)
return dp[-1]