题解 | #最小花费爬楼梯#
最小花费爬楼梯
https://www.nowcoder.com/practice/6fe0302a058a4e4a834ee44af88435c7
class Solution:
def minCostClimbingStairs(self, cost: List[int]) -> int:
a = b = 0
for i in range(2, len(cost) + 1):
a, b = b, min(a + cost[i - 2], b + cost[i - 1])
return b
查看10道真题和解析