题目链接：https://www.acwing.com/problem/content/description/19/
题目如下：
class Solution {
public:
int Fibonacci(int n) {
vector result(n+1);
//动态规划就是迭代
result[0]=0;
result[1]=1;
for(int i=2;i 
题目链接：https://www.acwing.com/problem/content/description/19/
题目如下：
class Solution {
public:
int Fibonacci(int n) {
vector result(n+1);
//动态规划就是迭代
result[0]=0;
result[1]=1;
for(int i=2;i 名师互学网 版权所有 (c)2021-2022 ICP备案号：晋ICP备2021003244-6号
