//大家都知道斐波那契数列,现在要求输入一个整数n,请你输出斐波那契数列的第n项(从0开始,第0项为0)。n<=39
class Solution {
public:
int Fibonacci(int n)
{
vector<int> vec(n+1, 0);
vec[1] = 1;
vec[2] = 1;
for (int i=3; i<=n; i++)
{
vec[i] = accumulate(vec.begin() + i - 2, vec.begin() + i, 0);
}
return vec[n];
}
};