lovecoding
/
VIP26


			
				
					
						
						
							1234567891011121314151617181920212223242526272829303132333435363738394041424344
							<!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>
      // 非递归方法
      function fibonacci(n) {
        if (n === 1 || n === 2) {
          return 1;
        } else {
          let a = 1;
          let b = 1;
          let result;
          for (let i = 3; i <= n; i++) {
            result = a + b;
            a = b;
            b = result;
          }
          return result;
        }
      }

      let N = 23; // 假设要求斐波纳契数列的第10项的值
      let fibonacciN = fibonacci(N);
      console.log(fibonacciN);
      // 递归方法
      function fibonacci(n) {
        if (n === 1 || n === 2) {
          return 1;
        } else {
          return fibonacci(n - 1) + fibonacci(n - 2);
        }
      }

      var n = 10; // 假设要求第10项的值
      var result = fibonacci(n);
      console.log(result); // 输出斐波纳契数列的第10项的值
    </script>
  </body>
</html>