利用数组递推,而不是函数的递归
function fib(N) {
let cache = [];
for (let i = 0; i < N; i++) {
if (i == 0 || i == 1) {
cache[i] = i;
}
cache[i] = cache[i - 1] + cache[i - 2];
}
return cache[N];
}
利用数组递推,而不是函数的递归
function fib(N) {
let cache = [];
for (let i = 0; i < N; i++) {
if (i == 0 || i == 1) {
cache[i] = i;
}
cache[i] = cache[i - 1] + cache[i - 2];
}
return cache[N];
}