The Fibonacci numbers, commonly denoted F(n)
form a sequence, called the Fibonacci sequence, such that each number is the sum of the two preceding ones, starting from 0
and 1
. That is,
F(0) = 0, F(1) = 1 F(N) = F(N - 1) + F(N - 2), for N > 1.
Given N
, calculate F(N)
.
Example 1:
Input: 2 Output: 1 Explanation: F(2) = F(1) + F(0) = 1 + 0 = 1.
Example 2:
Input: 3 Output: 2 Explanation: F(3) = F(2) + F(1) = 1 + 1 = 2.
Example 3:
Input: 4 Output: 3 Explanation: F(4) = F(3) + F(2) = 2 + 1 = 3.
Note:
0 ≤ N
≤ 30.
采用Dynamic Programming 和 memoization的方案,也有两种top-down 和bottom-up
top-down: 不需要用到递归
class Solution {
public int fib(int N) {
List<Integer> store = new LinkedList();
store.add(0);
store.add(1);
for(int i = 2; i <= N; i++) {
store.add(store.get(i-1)+store.get(i-2));
}
return store.get(N);
}
}
bottom-up:采用递归,不过在递归过程中使用memoization技术
class Solution {
public int fib(int N) {
List<Integer> store = new LinkedList();
store.add(0);
store.add(1);
return helper(N, store);
}
private int helper(int N, List<Integer> store) {
if(N < store.size()) return store.get(N);
store.add(helper(N-1, store) + helper(N-2, store));
return store.get(N);
}
}