代码随想录算法训练营第38天| 动态规划

LeetCode.509 斐波那契数

dp = [1]*(n+1)
dp[0] = 0
for i in range(2, len(dp)):
    dp[i] = dp[i-1] + dp[i-2]
return dp[-1]

LeetCode.70 爬楼梯

dp = [1]*(n+1)
for i in range(2, len(dp)):
    dp[i] = dp[i-1] + dp[i-2]
return dp[-1]

LeetCode.746 使用最小花费爬楼梯

for i in range(2, len(cost)):
    cost[i] += min(cost[i-1], cost[i-2])
return min(cost[-1], cost[-2])