第 8 期(2019-05-15)：求斐波那契数前N项 #10

Activity

1. liwenkang commented on May 15, 2019

   

   liwenkang

   on May 15, 2019

   More actions

   function getFibonacciArray(n) {
       let result = [];
       let map = new Map();
       map.set(1, 1);
       map.set(2, 1);
   
       function fibonacci(n) {
           if (map.get(n)) {
               return map.get(n);
           } else {
               let result = fibonacci(n - 2) + fibonacci(n - 1);
               map.set(n, result);
               return result;
           }
       }
   
       fibonacci(n);
       return map.values();
   }
2. AMY-Y commented on May 15, 2019

   

   AMY-Y

   on May 15, 2019

   Last edited by AMY-Y

   More actions

   function feibonacci(n){
               if(Math.round(n)===n){
                   var arr=[];
                   var sum1=1;
                   var sum2=1;
                   if(n==1){
                       arr.push(sum1);
                   }else{
                       arr.push(sum1);
                       arr.push(sum2);
                       for(var i=2;i<n;i++){
                           var temp;
                           temp=sum1+sum2;
                           sum1=sum2;
                           sum2=temp;
                           arr.push(temp);
                       }
                   }                
                   return arr;
               }
           }
           feibonacci(8);

   👍React with 👍1Reacted by liwenkang

   🎉React with 🎉1Reacted by Wing Meng
3. ahao430 commented on May 16, 2019

   

   ahao430

   on May 16, 2019

   Last edited by ahao430

   More actions

   function fibonacci(n) {
     if (n < 0) return []
   
     let res = []
     for (let i = 0; i < n; i++) {
       let num
       if (i === 0) num = 0
       else if (i === 1) num = 1
       else num = res[i - 1] + res[i - 2]
       res.push(num)
     }
     return res
   }