// 斐波那契算法
function fibonaqie1 (n) {
if(n <= 1) {
return n
}
let a = 0;
let b = 1;
for(let i = 2; i <= n; i++) {
let temp = a + b
a = b
b = temp
}
return b;
}
// console.log(fibonaqie1(6)); 8
// 递归实现(较为消耗性能)
function fibonaqie2(n) {
if(n <= 1) {
return n;
}
return fibonaqie2(n - 1) + fibonaqie2(n - 2)
}
// console.log(fibonaqie2(6));
斐波那契算法
最新推荐文章于 2024-07-22 15:13:59 发布