剑指Offer07 斐波那契数列

 /*************************************************************************
     > File Name: 07_Fibonacci.c
     > Author: Juntaran
     > Mail: JuntaranMail@gmail.com
     > Created Time: 2016年08月29日 星期一 20时23分54秒
  ************************************************************************/

 #include <stdio.h>

 long long Fibonacci1(int n)
 {
     if (n <= )
         return ;
     if (n == )
         return ;
     return Fibonacci1(n-) + Fibonacci1(n-);
 }

 long long Fibonacci2(int n)
 {
     int result[] = {, };
     if (n < )
         return result[n];

     long long fibNum1 = ;
     long long fibNum2 = ;
     long long temp = ;

     for (int i = ; i <= n; ++i)
     {
         temp = fibNum1 + fibNum2;
         fibNum1 = fibNum2;
         fibNum2 = temp;
     }
     return temp;
 }

 int main()
 {
     int n = ;
     long long ret1, ret2;
     ret1 = Fibonacci1(n);
     ret2 = Fibonacci2(n);
     printf("ret1 is %lld, ret2 is %lld\n", ret1, ret2);
 }