①
#define _CRT_SECURE_NO_WARNINGS 1;
#include <stdio.h>
int main()
{
int i = 1;
int n = 0;
int fab = 0;
int fib1 = 1;
int fib2 = 1;
scanf("%d", &n);
while (i <= (n-2))
{
fab = fib1 + fib2;
if (i % 2 != 0)
{
fib1 = fab;
}
else
{
fib2 = fab;
}
i++;
}
printf("%d", fab);
return 0;
}
②递归
#define _CRT_SECURE_NO_WARNINGS 1;
#include <stdio.h>
int Fibonacci(int n)
{
if (n > 2)
{
return Fibonacci(n - 1) + Fibonacci(n - 2);
}
else
{
return 1;
}
return 0;
}
int main()
{
int n = 0;
scanf("%d", &n);
printf("%d", Fibonacci(n));
return 0;
}
【C语言】函数递归-斐波那契数列实现
最新推荐文章于 2022-11-07 21:06:37 发布