JS实现斐波那契数列的五种方式(小结)

function fibonai(n){
 var res1 = 1;
 var res2 = 1;
 var sum = res2;
 for(var i = 1;i < n;i ++){
   sum = res1 + res2;
   res1 = res2;
   res2 = sum;
 }
 return sum;
}

function fibonai (n) {
 if ( n <= 1 ) {return 1};
 return fibonai(n - 1) + fibonai(n - 2);
}

function fibonai(n, ac1=1,ac2=1){
  if(n<=1){return ac2}
 return fibonai(n-1, ac2, ac1 + ac2)
}
Generator 函数和for...of循环
// Generator 函数和for...of循环
function fibonai() {
 let [prev, curr] = [0, 1];
　　// foo(;;)相当于死循环 等于while(1)
 for (;;) {
  yield curr;
  [prev, curr] = [curr, prev + curr];
 }
}
for (let n of fibonai()) {
 if (n > 1000) break;
 console.log(n);
}

const fibonai = function(){
  var mem = [0,1];
  var f = function(n){
    var res = mem[n];
    if(typeof res !== 'number'){
      mem[n] = f(n-1) + f(n-2);
      res = mem[n];
    }
    return res;
  }
  return f;
}();