🔗LC2648 🟢 Easy 🧩 Pattern – Generator Functions
Write a generator function that returns a generator object which yields the Fibonacci sequence.
The Fibonacci sequence is defined by the relation Xn = Xn-1 + Xn-2.
The first few numbers of the series are 0, 1, 1, 2, 3, 5, 8, 13.
Example
Example 1:
Input: callCount = 5
Output: [0,1,1,2,3]
Explanation:
const gen = fibGenerator();
gen.next().value; // 0
gen.next().value; // 1
gen.next().value; // 1
gen.next().value; // 2
gen.next().value; // 3
Example 2:
Input: callCount = 0
Output: []
Explanation: gen.next() is never called so nothing is outputtedCode language: JavaScript (javascript)Solution
/**
* @return {Generator<number>}
*/
var fibGenerator = function* (n) {
let current = 0;
let next = 1;
while (true) {
yield current;
[current, next] = [next, current + next]
}
};
/**
* const gen = fibGenerator();
* gen.next().value; // 0
* gen.next().value; // 1
*/Code language: JavaScript (javascript)