leetcode——746. 使用最小花费爬楼梯---动态规划

动态规划

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