26 lines
591 B
JavaScript
26 lines
591 B
JavaScript
const fibonacci = function(count) {
|
|
if (count < 0) return "OOPS";
|
|
if (count === 0) return 0;
|
|
|
|
let firstPrev = 1;
|
|
let secondPrev = 0;
|
|
|
|
for (let i = 2; i <= count; i++) {
|
|
let current = firstPrev + secondPrev;
|
|
secondPrev = firstPrev;
|
|
firstPrev = current;
|
|
}
|
|
|
|
return firstPrev;
|
|
|
|
};
|
|
|
|
// Another way to do it is by using an iterative approach with an array containing two values, 0 and 1.
|
|
// const fib = [0, 1];
|
|
// for (let i = 2; i <= count; i++) {
|
|
// fib[i] = fib[i - 1] + fib[i - 2];
|
|
// }
|
|
// return fib[count];
|
|
|
|
module.exports = fibonacci;
|