https://blog.csdn.net/xianfajushi/article/details/103451916
🎈具体代码:
#include<stdio.h>
int fabo(int n)
{
if (n == 1 || n == 2)
{
return 1;
}
return fabo(n - 1) + fabo(n - 2);
}
int main()
{
//递归求斐波那契数列的前50项的和
int i = 0;
for (i = 1; i <51;i++)
{
printf("%d\t", fabo(i));
}
return 0;
}