最近在复习算法,斐波那契数列问题采用了递推算法
// 斐波那契数列问题
#include <iostream>
using namespace std;
int Fibonacci(int time)
{
int t1;
int t2;
if (time == 1 || time == 2)
return 1;
else
{
t1 = Fibonacci(time - 1);
t2 = Fibonacci(time - 2);
return (t1 + t2);
}
}
int main()
{
int time, number;
cout << "请输入繁殖的时间(以月为单位):\n";
cin >> time;
number = Fibonacci(time);
cout << "经过" << time << "个月,繁殖出了" << number << "对兔子" << endl;
}