从零开始的LC刷题(107): Fibonacci Number 斐波那契数列

原题：

The Fibonacci numbers, commonly denoted F(n) form a sequence, called the Fibonacci sequence, such that each number is the sum of the two preceding ones, starting from 0 and 1. That is,

F(0) = 0,   F(1) = 1
F(N) = F(N - 1) + F(N - 2), for N > 1.

Given N, calculate F(N).

 

Example 1:

Input: 2
Output: 1
Explanation: F(2) = F(1) + F(0) = 1 + 0 = 1.

Example 2:

Input: 3
Output: 2
Explanation: F(3) = F(2) + F(1) = 1 + 1 = 2.

Example 3:

Input: 4
Output: 3
Explanation: F(4) = F(3) + F(2) = 2 + 1 = 3.

 

Note:

0 ≤ N ≤ 30.

斐波那契数列问题是经典的动态规划问题，但是看到了更有趣的解法，这里不提出普通的循环或者递归的算法了，先从子底而上的动态规划算法开始：

Success

Runtime: 0 ms, faster than 100.00% of C++ online submissions for Fibonacci Number.

Memory Usage: 8.2 MB, less than 100.00% of C++ online submissions for Fibonacci Number.

代码：

class Solution {
public:
    int fib(int N) {
        int l=0;
        int r=1;
        for(int i=0;i<N;i++){
            int sum=l+r;
            l=r;r=sum;
        }
        return l;
    }
};

还有自顶向下的记忆式动态规划：

Success

Runtime: 0 ms, faster than 100.00% of C++ online submissions for Fibonacci Number.

Memory Usage: 8.7 MB, less than 5.97% of C++ online submissions for Fibonacci Number.

代码：

class Solution {
public:
    unordered_map<int,int> fibo;
    int fib(int N) {
        if(N==0){return 0;}
        if(N==1){return 1;}
        if(fibo.find(N)!=fibo.end()){return fibo[N];}
        else {fibo[N]=fib(N-1)+fib(N-2);return fibo[N];}
    }
};

可以看出记忆式还是很占空间的。

solution里还有更有趣的两个解法，矩阵和数学，代码我就不写了原理贴下面：

矩阵：

数学：