剑指Offer:面试题9 斐波那契数列

/*
斐波那契数列:
写一个函数，输入n，求斐波那契数列的第n项
f(n)={0,n=0
     {1,n=1
{f(n-1)+f(n-2),n>1
输入:
11
输出:
89
*/
#include <stdio.h>
#include <string.h>
const int MAXSIZE = 100000;
long long fib[MAXSIZE];
long long fibonacci(int n)
{
fib[0] = 0;
fib[1] = 1;
for(int i = 2 ; i <= n ; i++)
{
fib[i] = fib[i-1] + fib[i-2];
}
return fib[n];
}


void process()
{
int n;
while(EOF != scanf("%d",&n))
{
memset(fib,0,sizeof(fib));
printf("%ld\n",fibonacci(n));
}
}


int main(int argc,char* argv[])
{
process();
getchar();
return 0;
}