斐波那契数列(阿里面试题)
function fibonacci(n) {
if (n <= 1) return 1
let arr = [1, 1];
//i表示的是即将常见多少个
let i = n + 1 - 2;
while (i > 0) {
let a = arr[arr.length - 2];
let b = arr[arr.length - 1];
arr.push(a + b)
i--;
}
return arr[arr.length - 1]
}
function fibonacci2(count) {
function rn(count, curr = 1, next = 1) {
if (count = 0) {
return curr;
} else {
return fn(count - 1, next, curr + next)
}
};
return fn(count)
}