斐波那契数列:1,1,2,2,5,8,13,21…
满足f[n]=f[n-1]+f[n-2]
题目链接:https://www.nowcoder.com/practice/c6c7742f5ba7442aada113136ddea0c3?tpId=196&&tqId=37094&rp=1&ru=/activity/oj&qru=/ta/job-code-total/question-ranking
递归:
int Fibonacci(int n){
if(n==0||n==1) return n;
return Fibonacci(n-1)+Fabonacci(n-2);
}
记忆化搜索:
int Fib(int n,vector<int>& dp){
if(n==0||n==1) return n;
if(dp[n]!=-1) return dp[n];
return dp[n]=Fib(n-1)+Fib(n-2);
}
int Fibonacci(int n){
vector<int> dp(45,-1);
return Fib(n,dp);
}