推荐关注
› Meteor
› JSLint - a JavaScript code quality tool
› jsFiddle
› D3.js
› WebStorm
推荐书目
› JavaScript 权威指南第 5 版
› Closure: The Definitive Guide
Paperex

Js 求斐波那契数列第 n 项的值结果总不对

  •  1
     
  •   Paperex · Apr 23, 2019 · 5422 views
    This topic created in 2756 days ago, the information mentioned may be changed or developed.

    代码如下:

    <!DOCTYPE html>
    <html lang="en">
    <head>
    	<meta charset="UTF-8">
    	<title>Document</title>
    </head>
    <body>
    	<script>
    		var num = parseInt(window.prompt('input'));
    		var first = 1;
    		var second = 1;
    		var third;
    		if(num > 2){
    			for(var i = 0; i < num-2; i++){
    				third = first + second;
    				first = second;
    				second = third;
    			}
    			document.write(third);
    		}
    		else{
    			document.write(1);
    		}
    	</script>
    </body>
    </html>
    

    输出结果第 4 项为 3,第 5 项为 4.调试后发现 first 的结果总是 1,真是搞不懂,请大神帮忙看看!

    17 replies  •  2019-04-23 13:10:16 +08:00
    yngby
    yngby
    Apr 23, 2019
    1
    为啥我试了一下没错呢
    mango88
    mango88
    Apr 23, 2019 via iPhone
    2
    第一项难道不是 1 ?
    wa8n
    wa8n
    Apr 23, 2019
    3
    我这对的
    wenzichel
    wenzichel
    Apr 23, 2019
    5
    没错的呀!

    ```javascript
    function fb(num) {
    var first = 1;
    var second = 1;
    var third;
    if(num > 2){
    for(var i = 0; i < num-2; i++){
    third = first + second;
    first = second;
    second = third;
    }
    return third;
    }
    else{
    return first;
    }
    }
    for(let i=1; i<10; i++) {
    console.log(i, fb(i));
    }
    /*
    1 1
    2 1
    3 2
    4 3
    5 5
    6 8
    7 13
    8 21
    9 34
    */
    ```
    wenzichel
    wenzichel
    Apr 23, 2019
    6
    不支持 markdown 啊,那我怎么删除我上面的这条评论呢
    DJQTDJ
    DJQTDJ
    Apr 23, 2019
    7
    <!DOCTYPE html>
    <html lang="en">
    <head>
    <meta charset="UTF-8">
    <title>Document</title>
    </head>
    <body>
    <script>
    var increment = 0;
    while(increment < 100) {
    var first = 1;
    var second = 1;
    var third;
    if(increment > 2){
    for(var i = 0; i < increment-2; i++){
    third = first + second;
    first = second;
    second = third;
    }
    document.write(increment + ":" + third + "<br>");
    }
    else{
    document.write(increment + ":" + 1 + "<br>");
    }
    increment++;
    }
    </script>
    </body>
    </html>

    没问题吖
    Jase
    Jase
    Apr 23, 2019
    8
    function fibonacci(n) {
    if (n === 1) {
    return 1;
    }

    if (n === 2) {
    return 1;
    }

    return fibonacci(n - 1) + fibonacci(n - 2);
    }
    ytmsdy
    ytmsdy
    Apr 23, 2019
    9
    @Jase 大兄弟,你这么写会爆栈的哦。。
    Paperex
    Paperex
    OP
    Apr 23, 2019
    10
    各位大哥,是我之前把 for 循环里的“ first ”写成了“ first ”。可这帖子没法删除……。感谢各位大神!
    dartabe
    dartabe
    Apr 23, 2019
    11
    各位大神 插一个问题 之前网上说这个数列求法最好不用递归 对 JS 是不是也成立呢?
    gosansam
    gosansam
    Apr 23, 2019❤️1
    12
    @dartabe 爆栈了解一下
    airdge
    airdge
    Apr 23, 2019
    13
    function F(n) {
    if (n == 1) {
    return 1
    } else if (n == 2) {
    return 1
    } else {
    return F(n - 1) + F(n - 2)
    }
    }
    console.log(F(9))
    airdge
    airdge
    Apr 23, 2019
    14
    @airdge 没注意看评论 这种确实不行
    stevenbipt
    stevenbipt
    Apr 23, 2019 via Android
    15
    递归写法是个狼人~
    silentstorm
    silentstorm
    Apr 23, 2019
    16
    通项公式:(Math.pow((1+Math.sqrt(5))/2,n)-Math.pow((1-Math.sqrt(5))/2,n))/Math.sqrt(5)
    就是会有精度损失
    bzw875
    bzw875
    Apr 23, 2019
    17
    function fibonacci(n) {
    if (n < 2) {
    return 1;
    }
    var arr = [1,1];
    for (i = 1; i < n; i++) {
    arr[i + 1] = arr[i - 1] + arr[i];
    }
    return arr[n];
    }
    console.log(fibonacci(10));
    你们要么函数栈太深,要么重复计算每个值,应该用一个数组保持每一项的值。这样比较快
    About   ·   Help   ·   Advertise   ·   Blog   ·   API   ·   FAQ   ·   Privacy   ·   Solana   ·   523 Online   Highest 6679   ·     Select Language
    创意工作者们的社区
    World is powered by solitude
    VERSION: 3.9.8.5 · 73ms · UTC 22:17 · PVG 06:17 · LAX 14:17 · JFK 17:17
    ♥ Do have faith in what you're doing.