【LeetCode】70. Climbing Stairs python3解法

题目描述：

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 --> 1
2 --> 2
3 --> 3
4 --> 5
…
可以发现每一个数都等于前两个数之和，只就是斐波那契数列。所以我们只需要定义前两个数，剩下的交给for循环就可以了。不过我尝试了很多方法，runtime始终不是很低，可能是LeetCode问题，哈哈。

代码：

class Solution:
    def climbStairs(self, n: int) -> int:
        if n == 1: return 1
        res = [1,2]
        for i in range(2,n):
            res.append(res[i-1] + res[i-2])
        return res[-1]