c_cpp 70.爬楼梯

Posted 2021-05-14

//使用Fibonacci sequence方法实现
//效率总体来说还是挺高的
//Runtime: 0 ms, faster than 100.00%
class Solution {
public:
    int climbStairs(int n) {
        int Fib[n] = {0};
        Fib[0] = Fib[1] = 1;
        // if(n <= 2)
        //     return n;
        // int* step = new int[n];
        for(int i = 2;i <= n;++i)
            Fib[i] = Fib[i-1] + Fib[i-2];
        return Fib[n];
    }
    
    // int Fib(int n){
    //     if(n <= 1)
    //         return 1;
    //     else
    //         return Fib(n - 1) + Fib(n - 2);
    // }
};