JavaScript fun: Fibonacci sequence generator

Create a function generator genfib (), which returns a function. Each time this function is executed, the next item in the Fibonacci series is returned, and the first item 0 is returned during the first execution. Example: Create a function generator genfib (), which returns a function. Each time this function is executed, the next item in the Fibonacci series is returned, and the first item 0 is returned during the first execution.

Example:

var fib = genfib();  fib(); // -> returns 0  fib(); // -> returns 1  fib(); // -> returns 1  fib(); // -> returns 2

When I got this question, I first thought it was done in genfib (), because it had to return a function, so I first returned a closure function in it, and there was something in render manager.

Then, based on the meaning of the question, we define an internal function in genfib () to evaluate the nth Fibonacci series. Here I use the divide recursion.

So how can we combine the closure function and this private function to achieve the effect of returning the next Fibonacci series for every execution?

You can use an internal pointer variable point, which starts to point to 0. Every time you call the closure function, we execute a private function and pass the pointer variable as a parameter, returns the Fibonacci number of the current item, and the pointer variable is auto-incrementing.

This achieves the goal.

function genfib(){      var point = 0;            var getFib = function(num){          if(num == 0){              return 0;          }          if(num == 1){              return 1;          }          return getFib(num-1) + getFib(num-2);      };            return function fib(){          return getFib(point++);      }  }

The above is the JavaScript interesting question: the content of the Fibonacci series generator. For more information, see the PHP Chinese website (www.php1.cn )!