递归加个记忆化数组即可
附代码:
class Solution {
public:
long long a[42] = {0};
void init(long long a[])
{
a[0] = 0;
a[1] = 1;
}
long long Fibonacci(int n) {
if(n==1||n==0) return n;
if(!a[n])
{
a[n] = Fibonacci(n-1)+Fibonacci(n-2);
}
return a[n];
}
};