746. 使用最小花费爬楼梯_动态规划

class Solution(object):
    def minCostClimbingStairs(self, cost):
        """
        :type cost: List[int]
        :rtype: int
        """

        res = [None] * len(cost)
        res[0] = cost[0]
        res[1] = cost[1]

        for i in range(2, len(cost)):
            res[i] = min(res[i - 1] + cost[i], res[i - 2] + cost[i])

        return min(res[-1], res[-2])