方法一:递归
class Solution {
public int fib(int n) {
if (n == 0 || n == 1) {
return n;
}
return fib(n - 1) + fib(n - 2);
}
}
方法二:动态规划 自顶向下
class Solution {
// 题目要求 0=< n <= 30
int[] memo = new int[31];
public int fib(int n) {
if (n == 0 || n == 1) {
return n;
}
if (memo[n] != 0) {
return memo[n];
}
memo[n] = fib(n - 1) + fib(n - 2);
return memo[n];
}
}
方法三:动态规划 自底向上
class Solution {
public int fib(int n) {
if (n == 0 || n == 1) {
return n;
}
// 存储子问题
int[] dp = new int[n + 1];
// base case
dp[0] = 0;
dp[1] = 1;
for (int i = 2; i <= n; i++) {
dp[i] = dp[i - 1]+ dp[i - 2];
}
return dp[n];
}
}