[DP]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

只要理解：由于一次可以跨越的台阶数是1个或者2个，所以到达第n个台阶的方法，是在第n-1个台阶跨一步，或者在第n-2个台阶上跨两步。也就是到达n-1个台阶的方法总数加上到达第n-2个台阶的方法。

实际就是求斐波那契数列。

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