题解 | #斐波那契数列#
斐波那契数列
http://www.nowcoder.com/practice/c6c7742f5ba7442aada113136ddea0c3
记录一下，用数组作为存储器，减少暴力递归的运算量，该算法的时间复杂度应该为O（n）
const store = [0,1,1]
function Fibonacci(n){
if(n<=2)
return 1
if (store[n]){
return store[n]
}
else
store[n] = Fibonacci(n-1) + Fibonacci(n-2)
return store[n]
}
const store = [0,1,1]
function Fibonacci(n){
if(n<=2)
return 1
if (store[n]){
return store[n]
}
else
store[n] = Fibonacci(n-1) + Fibonacci(n-2)
return store[n]
}