斐波那契数列
斐波那契数列
https://www.nowcoder.com/practice/c6c7742f5ba7442aada113136ddea0c3?tpId=13&tqId=11160&rp=1&ru=%2Fta%2Fcoding-interviews&qru=%2Fta%2Fcoding-interviews%2Fquestion-ranking&tab=answerKey
加个备忘录，不然会重复计算
public class Solution {
// 0 1 1 2 3 5 8
int[] dp = new int[45];
public int Fibonacci(int n) {
if(n == 0 || n == 1)
return n;
if(dp[n] != 0)
return dp[n];
return dp[n] = Fibonacci(n-1)+Fibonacci(n-2);
}
}
剑指offer 文章被收录于专栏
为刷过的每一道题都书写一篇题解，便于重复练习~
海康威视公司福利 399人发布
