70. Climbing Stairs

题目：

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

解析：

按照这个思路继续计算下去，可以发现这个类似于斐波那契数列，所以我就尝试了一下，发现是可以的。

然后再深究一下，要到达n，那么就要到达n-2或者n-1。

代码：

class Solution:
    def climbStairs(self, n):
        """
        :type n: int
        :rtype: int
        """
        current = 1
        next = 2
        for i in range(1, n):
            temp = current
            current = next
            next += temp
        return current