LeetCode 70 Climbing Stairs--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

这题是典型的动态规划问题，动态规划问题关键在于找到一个动态规划表的递推关系式，这里即为step[i]=step[i-1]+step[i-2],具体的代码如下啊

def climbStairs(self, n):
        """
        :type n: int
        :rtype: int
        """
        # if n == 0 or n == 1 or n == 2:
        #     return n #return 1 if n==1 else 2 脑子是短路了啊
        # return self.climbStairs(n-1)+self.climbStairs(n-2)   #这种算法怎么会超时啊。真的是麻烦啊卧槽,这个每个都要算所有会超时啊
        step=[0,1,2]
        for i in range(3,n+1):
            step.append(step[i-1]+step[i-2])#
        return step[n]