C++ 实现斐波那契数列和递归寻找+高效寻找

/*
*Definition:
*Author:
*Date:
*/
#include <iostream>
#include <array>
#include<vector>
using namespace std;

class Fibo{
   
	int m_num=0;
	const int m_firstNum = 0;
	const int m_secondNum = 1;
	vector<int>m_fib;
public:
	Fibo(){
   }
	Fibo(int n) :m_num(n)
	{
   
		int temp1 = m_firstNum