leetcode070-python 爬楼梯

You are climbing a stair case. It takes n steps to reach to the top.

Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?

Note: Given n will be a positive integer.

Example 1:

Input: 2
Output: 2
Explanation: There are two ways to climb to the top.
1. 1 step + 1 step
2. 2 steps

Example 2:

Input: 3
Output: 3
Explanation: There are three ways to climb to the top.
1. 1 step + 1 step + 1 step
2. 1 step + 2 steps
3. 2 steps + 1 step

---

解题要点：

1.首先想到的是用递归去做，n阶台阶的方法等于n-1阶和n-2阶方法之和，但是该方法时间超了；

class Solution:
    def climbStairs(self, n):
        if n == 1:
            return 1
        if n == 2:
            return 2
        else:
            return self.climbStairs(n-1) + self.climbStairs(n-2)

2.然后参考别人的做法，用了递推，其实就是斐波那契数列；

class Solution:
    def climbStairs(self, n):
        """
        :type n: int
        :rtype: int
        """
        num = [0, 1, 2]
        if n == 1:
            return num[1]
        if n == 2:
            return num[2]
        else:
            for i in range(3, n+1):
                num.append(num[i-1]+num[i-2])
            return num[n]