fib.cpp

来自「里面包含各种数据结构方面的知识,如链表,树,图等 含有vc代码」· C++ 代码 · 共 40 行

#include <iostream.h>
#include <stdlib.h>

long Fib(int n)
{
	if(n == 0 || n == 1) return n;		//递归出口
	else return Fib(n-1) + Fib(n-2);	//递归调用
}

/*
long Fib(int n)
{
	if(n == 0 || n == 1) return n;
	else
	{
		long int oneBack = 1, twoBack = 0, current;
		for(int i = 2; i <= n; i++)
		{
			current = oneBack + twoBack;
			twoBack = oneBack;
			oneBack = current;
		}
		return current;
	}
}
*/
void main(void)
{
	int n;
	cout << "输入要计算的斐波那契数列的项数n: ";
	cin >> n;

	if(n < 1)
	{
		cout << "参数出错!";
		exit(1);
	}
	cout << "Fib(n) = " << Fib(n) << endl;
}