斐波那契数列三种实现函数

方法一：

let fn = (function fn(n){    
    let _catch = {};    
    function f(n){            
        if(n == 1 || n == 2){            
            return 1;        
        }        
    if(_catch[n]){            
        return _catch[n]       
    }        
    let prev2 = f(n-2);        
    let prev1 = f(n-1);       
    _catch[n-1] = prev1;        
    _catch[n-2] = prev2;        
    return prev + next;    
    }    
    return f;
})()
console.log(fn(5))复制代码

方法二：

function fn1(n){    
    let [a,b] = [0,1]    
    for(let i = 1;i<n;i++){        
        [a,b] = [b,a+b]     
    }    
    return b
}
console.log(fn1(2))复制代码

方法三：

function fn2(n){   
    return Array(n-1).fill().reduce(([a,b],)=>{        
        return [b,a+b]    
    },[0,1])[1]
}
console.log(fn2(1))复制代码

转载于:https://juejin.im/post/5c769428e51d4539982f3bf5