力扣-746.使用最小花费爬楼梯

题目看不太懂，站在0和1的时候是不用花费的？

dp[i]表示到达当前楼梯 i 时候的最小花费

class Solution(object):
    def minCostClimbingStairs(self, cost):
        """
        :type cost: List[int]
        :rtype: int
        """
        n = len(cost)
        dp = [0] * (n + 1)
        for i in range(2, n + 1):
            dp[i] = min(cost[i - 1] + dp[i - 1], cost[i - 2] + dp[i - 2])
        return dp[n]


if __name__ == '__main__':
    cost = [1, 100, 1, 1, 1, 100, 1, 1, 100, 1]
    Sol = Solution()
    res = Solution.minCostClimbingStairs(Sol, cost)
    print(res)