#define _CRT_SECURE_NO_WARNINGS 1
#include <stdio.h>
int Fib(int n)
{
if (n <= 2)
return 1;
else if (n > 2)
return Fib(n - 1) + Fib(n - 2);
}
int main()
{
int n = 0;
int ret = 0;
scanf("%d", &n);
ret = Fib(n);
printf("ret=%d\n", ret);
return 0;
}
运用递归思想,写出斐波那契数列
最新推荐文章于 2024-07-04 11:10:43 发布