C++ 斐波那契数列递归求解

最新推荐文章于 2024-02-28 23:34:20 发布

sim8011

最新推荐文章于 2024-02-28 23:34:20 发布

阅读量1.9k

点赞数

文章标签： c++ 动态规划算法

本文链接：https://blog.csdn.net/sim8011/article/details/122729480

版权

#include <iostream>
#include <vector>
using namespace std;

int num = 0;
vector<int> vec;
int Fibonacci(int n){
	++ num;
	cout << "第" << num <<"次 "; 
	if(n == 1 || n == 2){
		vec[n] = 1;
		cout << 1 << "\n";
		return 1;
	}
	int b = Fibonacci(n - 1) + Fibonacci(n - 2);
	vec[n] = b;
	cout << b << "\n";
	return b;
}

int main(){
	int a;
	cout << "请输入斐波那契数列长度：";
	cin >> a;
	vec = vector<int>(a+1,-1);
	a = Fibonacci(a);
	std::vector<int>::iterator it = vec.begin() +1;
	for(; it != vec.end(); ++it){
		cout << *it << "\t";
	}
	cout << "斐波那契数列是：" << a << endl << "计算次数：" << num << endl;
}