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条)

报告相同问题?

悬赏问题

  • ¥15 我想在一个软件里添加一个优惠弹窗,应该怎么写代码
  • ¥15 fluent的在模拟压强时使用希望得到一些建议
  • ¥15 STM32驱动继电器
  • ¥15 Windows server update services
  • ¥15 关于#c语言#的问题:我现在在做一个墨水屏设计,2.9英寸的小屏怎么换4.2英寸大屏
  • ¥15 模糊pid与pid仿真结果几乎一样
  • ¥15 java的GUI的运用
  • ¥15 我想付费需要AKM公司DSP开发资料及相关开发。
  • ¥15 怎么配置广告联盟瀑布流
  • ¥15 Rstudio 保存代码闪退