1.使用递归的方法求斐波那契数列
#include<stdio.h>
int fib(int n)
{
if (n <= 2)
{
return 1;
}
else
{
return fib(n - 1) + fib(n - 2);
}
}
int main()
{
int N = 0;
scanf("%d", &N);
int ret = fib(N);
printf("%d\n", ret);
return 0;
}
2.使用迭代的方法求斐波那契数列
#include<stdio.h>
int fib(int n)
{
int a = 0, b = 1, c;
if (n == 0)
return a;
for (int i = 2; i <= n; i++)
{
c = a + b;
a = b;
b = c;
}
return b;
}
int main()
{
int N = 0;
scanf("%d", &N);
int ret = fib(N);
printf("%d\n", ret);
return 0;
}