[LeetCode]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.
       题目大意：假设有一段台阶，需要走n步走到最顶端。每次只能走一个或者两个台阶，问有多少种走法才能走到顶端
       假设走到最顶端共有count(n)中走法，那么count(n)取决于最后一步走两个台阶还是一个台阶，如果走一个台阶，有count(n-1)种走法，如果走两个台阶，有count(n-2)种走法，所以count(n)=count(n-1)+count(n-2)

样例

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

python解法

class Solution:
    def decorator(func):
        d = {}
        def wrapper(*args, **kwargs):
            if args in d:
                return d[args]
            else :
                d[args] = func(*args, **kwargs)
                return d[args]
        return wrapper
    @decorator
    def climbStairs(self, n: int) -> int:
        if n == 1:
            return 1
        elif n == 2:
            return 2
        else:
            return self.climbStairs(n-2) + self.climbStairs(n-1)

Runtime: 36 ms, faster than 66.28% of Python3 online submissions for Climbing Stairs.
Memory Usage: 13.9 MB, less than 5.97% of Python3 online submissions for Climbing Stairs.
题后反思：

1. 学会使用python的语法糖很有用处，可以避免重复计算
2. 注意wrapper函数要有返回值

C语言解法

int stairs[100] = {0};
int climbStairs(int n){
    if (stairs[n] != 0)
    {
        return stairs[n];
    }
    else if (n == 1)
    {
        stairs[1] = 1;
        return 1;
    }
    else if (n == 2)
    {
        stairs[2] = 2;
        return 2;
    }
    else 
    {
        stairs[n] = climbStairs(n-1) + climbStairs(n-2);
        return stairs[n];
    }
}

Runtime: 0 ms, faster than 100.00% of C online submissions for Climbing Stairs.
Memory Usage: 6.8 MB, less than 50.00% of C online submissions for Climbing Stairs.
题后反思：

1. 与python解题思想一致，都是将一些计算过的值保存下来，遇到的时候直接返回，避免重复计算和递归调用。

文中都是我个人的理解，如有错误的地方欢迎下方评论告诉我，我及时更正，大家共同进步