#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<stdlib.h>//递归和非递归分别实现求第n个斐波那契数。
int Fibonaccisequence(int n)
{
int number1 = 1;
int number2 = 1;
int answer=0;
//如果n=1,2;直接返回1
if (n == 1 || n == 2)
{
return 1;
}
//1.创建一个循环,让循环里边的变量的项等于前两项之和然后返第n项
else
{
n = n - 2;
while (1)
{
answer = number1 + number2;
number1 = number2;
number2 = answer;
n -= 1;
if (n == 0)
{
break;
}
}
}
return answer;
}
int main()
{
int n = 0;
scanf("%d", &n);
printf("%d\n",Fibonaccisequence(n));
system(“pause”);
return 0;
}
常规法求斐波那契数列的最后一项的值
最新推荐文章于 2021-09-08 17:57:30 发布