题解 | 最小花费爬楼梯

class Solution:
    def minCostClimbingStairs(self , cost: List[int]) -> int:
        # write code here
        n = len(cost)
        dp = [0]*(n+1)
        for i in range(2,n+1):
            dp[i] = min(dp[i-1]+cost[i-1],dp[i-2]+cost[i-2])
        return dp[n]
if __name__=="__main__":
    cost = list(map(int,input().split()))
    S=Solution()
    print(S.minCostClimbingStairs(cost))

1.看边界

2.建数组

3.初始化

4.填公式

5.返回