面试题： 生成器实现斐波那契

1. 使用生成器实现斐波那契

注意： 1. 使用yield

2. 代码

def create_num(count):
    current_count = 0
    a, b = 0, 1
    while current_count < count:
        yield a
        a, b = b, a + b
        current_count += 1


obj = create_num(20)

# res = next(obj)
# print(obj)

for num in obj:
    print(num)


# while True:
#     try:
#         res = next(obj)
#         print(res)
#     except Exception as e:
#         break