【JS】斐波那契数列实现（递归与循环）

斐波那契数列实现【递归与循环】

1.循环

    <script>
        var line = parseInt(prompt("input lines:"));
        var a = 1,
            b = 1;
        for (var i = 0; i < line / 2; i++) {
            document.write(a + "</br>", b + "</br>");
            a = a + b;
            b = b + a;
        }
    </script>

2.递归

<script>
    function fabio(line) {
        if (line == 1 || line == 2)
            return 1;
        else
            return fabio(line - 1) + fabio(line - 2);
    }
    
    var line = parseInt(prompt("input lines:"));
    
    for (var i = 1; i <= line; i++) {
        if (i < line)
            document.write(fabio(i) + '</br>');
        else
            document.write(fabio(i));
    }
</script>