剑指 Offer II 088. 爬楼梯的最少成本

class Solution(object):
    def minCostClimbingStairs(self, cost):
        """
        :type cost: List[int]
        :rtype: int
        """
        # 以i结尾，花费最少体力值为f[i]
        # f[i]=min(f[i-1]+cost[i],f[i-2]+cost[i])
        # f[n-1]
        f=[0 for i in range(len(cost)+1)]
        cost.append(0)
        f[0]=cost[0]
        f[1]=cost[1]
        for i in range(2,len(f)):
            f[i]=min(f[i-1],f[i-2])+cost[i]
        return f[-1]