求第n位斐波那契数(非递归)

/*
求第n位斐波那契数
*/
#include<stdio.h>
#include<Windows.h>
#pragma warning (disable:4996)

void Fibonaccii(int n)
{

int i = 0;
int first = 1;
int second = 1;
int third = 0;
if (n < 3)
	printf("%d", 1);
else
{
	for (i = 0; i < n - 2; i++)
	{
		third = second + first;
		first = second;
		second = third;
	}
	printf("%d\n", third);
}

}

int main()
{

int n = 0;
printf("请输入需要输出第多少位斐波那契数:");
scanf("%d", &n);
Fibonaccii(n);
system("pause");
return 0;

}

猜你喜欢

转载自blog.csdn.net/Mmonster23/article/details/101999214