剑指offer 面试题9 求Fibonacci数列

#include <iostream>using namespace std;int fibo_recursion(int n){if(n==0) return 0;if(n==1) return 1;return fibo_recursion(n-1)+fibo_recursion(n-2);} int fibo_ascend(int n){if(n==0) return 0;if(n==1) return 1;int a=0,b=1,c=0;for(int i=1;i<n;++i){c=a+b;a=b;b=c;}return c;}int main(){int num=3;cout<<fibo_recursion(num);cout<<fibo_ascend(num);}