斐波那契数列

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

using namespace std;

#define COMPARE(x,y) (((x)<(y)) ? -1 : (((x)==(y)) ? 0 : 1))


void fibo(int i,int end,vector<int> &f) {
	
	if (i < end) {
		if (i == 0) {
			f.push_back(0);
			fibo(i + 1, end, f);
		}
		
		else if (i == 1) {
			f.push_back(1);
			fibo(i + 1, end, f);
		}
		
		else
		{
			f.push_back(f[i - 1] + f[i - 2]);
			fibo(i + 1, end, f);
		}
	}
	else
	{

		cout << "end" << endl;
	}
}

using namespace std;

int main() {
	vector<int>test;
	cout << "how many finums do you want get : " << endl;
	int end;
	cin >> end;
	fibo(0, end, test);
	for (int i = 0; i < test.size(); i++)
	{
		cout << test[i] << " ";
	}
	return 0;
}