剑指offer---斐波那契额列（9）

/递归解法#include <iostream>using namespace std;#if 0long long Fibonacci(unsigned int n){    if(n == 0 )    return 0;    if(n == 1)    return 1;    return Fibonacci(n-1) + Fibonacci(n-2);}#endif//非递归解法long long Fibonacci(unsigned int n){    int result[2] = {0,1};    if(n < 2)    {        return result[n];    }    long long one = 0;    long long two = 1;    long long fibn = 0;    for(unsigned int i=2;i <= n;i++)    {        fibn = one + two;        one = two;        two = fibn;    }    return fibn;}int main(){    long long tmp = Fibonacci(6);    cout<<tmp<<endl;}