斐波那契的递归优化
const fabonaci = (n) =>{
return n==1|| n==2 ? 1:fabonaci(n-1)+fabonaci(n-2)
}
console.log(fabonaci(9))
//动态规划
function fabo(n){
let [a,b] = [0,1];
for(let i = 0;i<n-1;i++){
[a,b] = [b,a+b]
}
return b
}
console.log(fabo(9))