// 求斐波那契数(递归写法)
// 2022-12-26 @nianjin
# include <stdio.h>
int solve(int n)
{
if (n == 1 || n == 0) return 1; //递归出口先写
else return solve(n - 1) + solve(n - 2);
}
int main(void)
{
int n;
scanf("%d", &n);
printf("%d", solve(n));
return 0;
}
求斐波那契数列(递归)(C语言)
最新推荐文章于 2023-09-18 21:17:02 发布