斐波那契数列的特点是:后面的数字是前两项的和,即:1,1,2,3,5,8,13,21......
Python代码如下:
numberA,numberB = 0,1
while numberA < 1000:
print(numberA,end='n')
numberA,numberB = numberB,numberA+numberB
显示如下结果:
0
1
1
2
3
5
8
13
21
34
55
89
144
233
377
610
987
第三章_穿越的魔法_循环/3.9_课后作业/3.9_作业2.py · master · 卡农民 / Python青少年趣味编程_课后习题 · GIT CODEhttps://gitcode.net/weixin_55357349/python-_/-/blob/master/%E7%AC%AC%E4%B8%89%E7%AB%A0_%E7%A9%BF%E8%B6%8A%E7%9A%84%E9%AD%94%E6%B3%95_%E5%BE%AA%E7%8E%AF/3.9_%E8%AF%BE%E5%90%8E%E4%BD%9C%E4%B8%9A/3.9_%E4%BD%9C%E4%B8%9A2.py
