lovecoding
/
W250913


			
							12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152
							<!DOCTYPE html>
<html lang="en">
<head>
    <meta charset="UTF-8">
    <meta name="viewport" content="width=device-width, initial-scale=1.0">
    <title>Document</title>
</head>
<body>
    <script>
        // 1 1 2 3 5 8 
        function Fibonacci(n){
            if(n<3){
                return 1;
            }else{
                // 前两项
                var a = 1;
                // 前一项
                var b = 1;
                for(var i=3;i<=n;i++){
                    var c = a + b;
                    a = b;
                    b = c;
                }
                return b;
            }
        }
        // console.log(Fibonacci(6))

        function Fibonacci2(n){
            if(n<3){
                return 1;
            }else{
                var arr = [1,1];
                for(var i=3;i<=n;i++){
                    arr[i-1] = arr[i-2] + arr[i-3];
                }
                return arr[n-1]
            }
        }
        // console.log(Fibonacci2(6));


        function Fibonacci3(n){
            if(n<3){
                return 1;
            }
            return Fibonacci3(n-1) + Fibonacci3(n-2);
        }
        console.log(Fibonacci3(6));
    </script>
</body>
</html>