int fibonacci(int pos)
{
if (pos == 1 || pos == 2)
{
return 1;
}
return fibonacci(pos - 1) + fibonacci(pos - 2);
}
int main()
{
for (int i = 1; i < 10; ++i)
{
printf("%d\n",fibonacci(i));
}
return 0;
}
c语言 斐波那契数列(递归方式)
于 2023-05-29 16:51:37 首次发布