题解 | #最小花费爬楼梯#

#
# 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
#
# 
# @param cost int整型一维数组 
# @return int整型
#
class Solution:
    def minCostClimbingStairs(self , cost: List[int]) -> int:
        # write code here
        length = len(cost)
        dp =[0 for i in range(length)]
        dp[0]=cost[0]
        dp[1]=cost[1]

        for i in range(2,length):
            dp[i]=min(dp[i-1],dp[i-2])+cost[i]
        
        mincost=min(dp[length-1],dp[length-2])
        return mincost