斐波那契数列递归解法,先学习基本的递归,动态规划以后再想…
#include<iostream>
#include<string>
#include<cctype>
#include <vector>
#include<exception>
#include <initializer_list>
#include<stack>
using namespace std;
class Solution {
public:
int Fibonacci(int n) {
if (n <= 2) { return 1; }
return Fibonacci(n - 2) + Fibonacci(n - 1);
}
};
int main()
{
Solution a;
vector<int> in = { 4, 7, 2, 1, 5, 3, 8, 6 },b;
cout << a.Fibonacci(6);
}