题解 | 最小花费爬楼梯

#
# 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
#
# 
# @param cost int整型一维数组 
# @return int整型
#
class Solution:
    def p(self, s):
        dp = [0] *(len(s)+1)
        dp[0] = 0
        dp[1] = 0

        for i in range(2,len(s)+1):
            dp[i] = min(dp[i-1]+s[i-1], dp[i-2]+s[i-2])
        return dp[len(s)]
    def minCostClimbingStairs(self , cost: List[int]) -> int:
        # write code here
        return self.p(cost)