[LeetCode By Python]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

刚开始我没什么想法，然后看了L e e t C o de的解释，我才明白可以用斐波那契数列解决问题呀！

代码＋调试

class Solution(object):
    def climbStairs(self, n):
        """
        :type n: int
        :rtype: int
        """
        prenum = 1
        curnum = 1
        for i in range(1,n):
            prenum ,curnum = curnum,prenum+curnum
        return curnum

a = Solution()
print a.climbStairs(5)

拓宽一下，如果不是走一步台阶，走两步台阶，而是将问题扩大为走m步台阶，走n步台阶，则可以这样想，每一次是走n步，还是m步，则可以使用递归方法step(x-m)+step(x-n)