dtpf76658 2019-07-20 23:17
浏览 115
已采纳

我应该在代码中进行哪些更改以生成从0 1 1开始的斐波那契数列

I've searched older questions, there are tons of them. However I couldn't find the answer to my case.


func fibonacci() func() int {
    y := 0
    z := 1

    return func () int {

        res := y + z
        y = z
        z = res

        return res

    }
}

func main() {
    f := fibonacci()
    for i := 0; i < 10; i++ {
        fmt.Println(f())
    }
}

This produces 1 2 3 5 8

What should I change (as little as possible) to get 0 1 1 2 3 5 8 ?

Actually I managed to solve that if initial y and z were like this:

    y := -1
    z := 1

But that's a fortunate hack, and I want a logical solution.

  • 写回答

3条回答 默认 最新

  • douluan5738 2019-07-20 23:26
    关注

    Change your function to return res to this:

     return func () int {
    
        res := y
        y = z
        z = res + z
    
        return res
    
    }
    

    This way you output the initial values first, and calculate the next values. Your current solution overwrites the initial values before they are returned.

    本回答被题主选为最佳回答 , 对您是否有帮助呢?
    评论
查看更多回答(2条)

报告相同问题?

悬赏问题

  • ¥20 基于MSP430f5529的MPU6050驱动,求出欧拉角
  • ¥20 Java-Oj-桌布的计算
  • ¥15 powerbuilder中的datawindow数据整合到新的DataWindow
  • ¥20 有人知道这种图怎么画吗?
  • ¥15 pyqt6如何引用qrc文件加载里面的的资源
  • ¥15 安卓JNI项目使用lua上的问题
  • ¥20 RL+GNN解决人员排班问题时梯度消失
  • ¥60 要数控稳压电源测试数据
  • ¥15 能帮我写下这个编程吗
  • ¥15 ikuai客户端l2tp协议链接报终止15信号和无法将p.p.p6转换为我的l2tp线路