leetcode 746 使用最小花费爬楼梯 ★

这道题有点不好理解，要增加一个地面和楼顶就好理解了。

class Solution:
    def minCostClimbingStairs(self, cost: List[int]) -> int:
        if cost == None:
            return 0
        elif len(cost) == 1:
            return cost[0]
        elif len(cost) == 2:
            return min(cost[1], cost[0] + cost[1])
        else:
            count0 = cost[0]
            count1 = min(cost[1], cost[0] + cost[1])
            for i in range(2, len(cost)):
                count2 = min(count0, count1) + cost[i]
                count0, count1 = count1, count2
            return min(count0, count2)