斐波拉契数列通过JavaScript实现，简单易懂

第一种

        function fb1(n) {
            if (n <= 2) {
                return 1;
            } else {
                return fb1(n - 1) + fb1(n - 2);
            }
        }
        let str = '';
        for (let i = 1; i < 11; i++) {
            str += fb1(i)+','
        }
        console.log(str);

结果：

 第二种

        function fb(n) {
            let a1 = 1;
            let a2 = 1;
            let sum = a2;
            for (let i = 2; i < n; i++) {
                sum = a1 + a2
                a1 = a2 ;
                a2 = sum 
            }
            return sum;
        }

第三种

        function fb2(n, a = 1, b = 1) {
            if (n <= 2) {
                return b
            } else {
                return fb2(n - 1, b, a + b)
            }
        }