题解 | #斐波那契数列#
斐波那契数列
https://www.nowcoder.com/practice/c6c7742f5ba7442aada113136ddea0c3
function Fibonacci(n) { // write code here if (n < 3) return 1 const previous = [1, 1] for (let i = 3; i < n; i++) { const currentValue = previous[0] + previous[1] previous[0] = previous[1] previous[1] = currentValue } return previous[0] + previous[1] } module.exports = { Fibonacci : Fibonacci };