迭代法计算斐波那契数列
程序员文章站
2022-05-25 09:27:07
1 1 1 2 3 5 8 first second result first second result (N>2) ......
def f(n): second = 1 result = 1 while (n>2): n-=1 first = second second = result result = second +first print result return result
[f(i) for i in range(16)]
out[15]: [1, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610]
1 1 1 2 3 5 8
first second result
first second result (n>2)
上一篇: 成都金沙美食排行榜都有哪些美食上榜了?
下一篇: Git命令的总结