test代码 lbsjs 2023-08-26 20 阅读1分钟 def fib(max): n, a, b = 0, 0, 1 while n < max: yield b a, b = b, a + b n = n + 1 return 'done' if __name__=='__main__': for a in fib(6): print(a)