斐波那契数:1,1,2,3,5,8,13,21......等前两个数字之和=第三个数字的数列
int fib(int n)
{
if (n <= 2)
{
return 1;
}
else
{
return fib(n - 1) + fib(n - 2);
}
}
int main()
{
int n = 0;
printf("input:");
scanf("%d", &n);
printf("%d", fib(n));
return 0;
}
斐波那契数:1,1,2,3,5,8,13,21......等前两个数字之和=第三个数字的数列
int fib(int n)
{
if (n <= 2)
{
return 1;
}
else
{
return fib(n - 1) + fib(n - 2);
}
}
int main()
{
int n = 0;
printf("input:");
scanf("%d", &n);
printf("%d", fib(n));
return 0;
}