斐波那且数列的三种解法

效率最差

#include <iostream>

using namespace std;

int fib(int n)
{
    if(n<1) return 0;
    if(n == 1 || n == 2)  return 1;
    return fib(n-1) + fib (n-2);
}

int main()
{  
    long long n = fib(45);    
    cout << n << endl;
}

效率次之

#include <iostream>
#include <vector>
using namespace std;

int fib(int n)
{
    vector <long> tab(n+1,0L);
    tab[1] = tab[2] = 1L;
    for(int n = 3; n < tab.size(); n++)
    {
        tab[n] = tab[n-1] + tab[n-2];
    }

    return tab[n];
}

int main()
{
    long n = fib(30);
    cout << n << endl;
}

效率最好

#include <iostream>

using namespace std;

int fib(int n)
{
    if(n < 1) return 0;
    if ( n == 1 || n == 2 ) return 1;
    int pre = 1,curr = 1;
    for(int i = 3; i <= n; i++)
    {
        int sum = pre + curr;
        pre = curr;
        curr = sum;
    }
    return curr;
}

int main()
{
    int n = fib(30);
    cout << n << endl;
}