1 #定义斐波那契数列 Fibonacci,除第一个和第二个数外,后面的任意一个数都是由前面两个数相加得到 2 def fib(max): # 返回多少个数 max 3 n, a, b = 0, 0 , 1 4 5 while n < max: 6 print(b) 7 a, b = b, a + b 8 n += 1 9 return " " 10 11 print('\n普通函数实现方式:') 12 print(fib(6)) 13 14 15 16 17 18 def fib_gen(max): # 返回多少个数 max 19 n, a, b = 0, 0 , 1 20 21 while n < max: 22 yield b 23 a, b = b, a + b 24 n += 1 25 return " " 26 27 28 print('\n生成器函数实现方式:') 29 f = fib_gen(6) 30 print(next(f)) 31 print(next(f)) 32 print(next(f)) 33 print(next(f)) 34 print(next(f)) 35 print(next(f)) 36 print(next(f))