爬楼梯

递归解法：

class Solution:
    def climbStairs(self, n: int) -> int:
        cache = {}
        return self.climb(n, cache)
    def climb(self, n: int, cache):
#基本情况是0,1,2
        if n == 0:
            return 0
        elif n == 1:
            return 1
        elif n == 2:
            return 2
        elif n in cache:
            return cache[n]
        else:
            cache[n] = self.climb(n - 2, cache) + self.climb(n - 1, cache)
            return cache[n]

方法就是每次调用climb的n-2和n-1两种情况，直到为基本情况

斐波那契法：

n层的所有情况即为n-1和n-2两种，即，转换为斐波那契数列的计算：

class Solution:
    def climbStairs(self, n: int) -> int:
        result = [0,1,2]
        len_re = 3
        if n < len_re:
            return result[n]
        else:
            for i in range(3, n + 1):
                temp = result[-1] + result[-2]
                result[-2] = result[-1]
                result[-1] = temp
        return result[-1]