题解 | #最小花费爬楼梯#
最小花费爬楼梯
https://www.nowcoder.com/practice/6fe0302a058a4e4a834ee44af88435c7
#
# 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
class Solution:
def minCostClimbingStairs(self , cost: List[int]) -> int:
# write code here
n =len(cost)
dp =[cost[0],cost[1]]
for i in range(2,n):
dp.append(min(dp[i-1]+cost[i],dp[i-2]+cost[i]))
print(dp)
return min(dp[-1],dp[-2])
查看14道真题和解析