fibonacci数列

//        0                 n=0
//f(n)=   1                 n=1,2
//        f(n-1)+f(n-2)     n>2
#include <iostream>
using namespace std;
int max(int a, int b) {
return a > b ? a : b;
}

int fibonacci(int n){
if(n == 0)
return 0;
if(n == 1 || n == 2 )
return 1;
int n1 = 1;
int n2 = 1;
for(int i=3;i<=n;i++) {
int temp = n1;
n1 = n2;
n2 = temp + n2;
}
return n2;
}
int main(){
for(int i=0;i<10;i++) {
cout<<"fibonacci("<<i<<"):"<<fibonacci(i)<<endl;
}
return 0;
}