python 递归函数实现斐波那契数列

Posted 2021-05-09

def fib(num):
    n, a, b = 0, 0, 1
    while n < num:
        yield(b)
        a, b = b, a+b
        n = n+1
    return 'done'


for n in fib(5):
    print(n)