1.这个用的是函数递归
#include<stdio.h>
int fib(int i)
{
if (i <= 2)
return 1;
else
{
return (fib(i - 1) + fib(i - 2));
}
}
//求斐波那契数列
int main()
{
int n = 0;
scanf("%d", &n);
int ret = 0;
ret = fib(n);
printf("%d ", ret);
return 0;
}
2.这个是效率高的代码
#include<stdio.h>
int fib(int n)
{
int a = 1;
int b = 1;
int c = 1;
while (n > 2)
{
c = a + b;
a = b;
b = c;
n--;
}
return c;
}
int main()
{
int n = 0;
scanf("%d", &n);
int ret = 0;
ret = fib(n);
printf("%d\n ", ret);
return 0;
}