JavaScript用循环实现斐波那契数列

        用循环来做,效率高,不需要重新计算

function f(n){

            if(n<3){

                return 1;

            }else{

                var f1=1,f2=1,fn;

                // 从3开始循环

                for(var i=3;i<=n;i++){

                    fn=f1+f2;

                    f1=f2;

                    f2=fn;

                }

                return fn;

            }

        }

        console.log(f(200));//2.8057117299251016e+41
//小伙伴们可以用这个来和递归的做法比较来康康差异