#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<stdlib.h>
int main()
{
int n, i;
int a1=1;
int b2 = 1;
int c = 0;
scanf("%d", &n);
if (n == 1 || n == 2)
printf("那个数为1");
else
{
for (int i = 3; i <= n ; i++)
{
c = a1 + b2;
a1 = b2;
b2 = c;
}
printf("%d", c);
}
system("pause");
return 0;
}*/
/*#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<stdlib.h>
int Feibo(int n)
{
if (n == 1 || n == 2)
{
return 1;
}
return Feibo(n - 1) + Feibo(n - 2);
}
int main()
{
int n;
scanf("%d", &n);
printf("%d", Feibo(n));
system("pause");
return 0;
}*/
【C语】递归与非递归实现第n个斐波那契数列
最新推荐文章于 2022-07-18 16:39:13 发布