斐波那契数列简洁实现函数，用的自取

function fbnq(num){
    let c  = [1,1];
    for(let e = 2;e<=num;e++){
        c.push((c[e-1]+c[e-2]))//c=[1]
    }
    if(num<=c.length){
        c = c.splice(0,num)
    }
    console.log(c)
}
fbnq(3)

function fib(n,ca1=1,ca2=1){
    if(n===1 || n===2){
        return ca2;
    }
    return fib(n-1,ca2,ca1+ca2);
}
console.log(fib(100)); //354224848179262000000