#include <stdio.h>
//斐波拉奇数列 F(0)=0;F(1)=1;F(n)=F(n-1)+F(n-2),n>=2;
int test1(int n)
{
if ( n == 0 )
{
return 0;
}
if (n == 1 || n == 2 )
{
return 1;
}
else if (n > 2)
{
return test1(n - 1) + test1(n - 2);
}
}
int main(void)
{
printf("%d", test1(15));
return 0;
}
展开分析理解