力扣动态规划使用最小花费爬楼梯

郝沣冰淇淋

于 2024-03-05 21:45:44 发布

阅读量171

点赞数 3

文章标签： leetcode 动态规划算法

本文链接：https://blog.youkuaiyun.com/Puj1ing1/article/details/136490937

版权

python3：

class Solution:
    def minCostClimbingStairs(self, cost: List[int]) -> int:
        n = len(cost)
        prev = curr = 0
        for i in range(2, n + 1):
            nxt = min(curr + cost[i - 1], prev + cost[i - 2])
            prev, curr = curr, nxt
        return curr