什么是斐波那契数列?
斐波那契数列(Fibonacci sequence),又称黄金分割数列,因数学家莱昂纳多·斐波那契(Leonardo Fibonacci)以兔子繁殖为例子而引入,故又称为“兔子数列”。斐波那契数列指的是这样一个数列:1,1,2,3,5,8,13,21,34,55,89…这个数列从第3项开始,每一项都等于前两项之和。
递归法:
int Fib(int num)
{
if (num <= 2)
{
return 1;
}
return Fib(num - 1) + Fib(num - 2);
}
int main()
{
int i = 0;
printf("请输入要查找的斐波那契数的项数:\n");
scanf("%d", &i);
int ret = 0;
ret = Fib(i);
printf("%d", ret);
return 0;
}
迭代法:
int Fib(int num)
{
int a = 1;
int b = 1;
int c = 1;
while (num >= 3)
{
c = a + b;
a = b;
b = c;
num--;
}
return c;
}
int main()
{
int i = 0;
printf("请输入要查找的项数:\n");
scanf("%d", &i);
int ret = 0;
ret = Fib(i);
printf("%d", ret);
}