In [1]: def feibonaqie(times):
...: n = 0
...: a, b = 0, 1
...: while n < times:
...: # print(b)
...: yield b
...: a, b = b, a + b
...: n = n + 1
...:
In [2]: P=feibonaqie(3)
In [3]: next(P)
Out[3]: 1
In [4]: next(P)
Out[4]: 1
In [5]: next(P)
Out[5]: 2
python斐波拉契数列(生成器)
最新推荐文章于 2024-05-30 02:36:44 发布