非递归

def fib(n):
    a,b=0,1
    while a < n:
        print(a,end=' ')
        a,b=b,a+b
    print()

 

 

输出小于n的项

def fib(n, a=0, b=1):
if  a > stop:
        returnprint(a,end=' ')
    fib(n, b, a+b)

 

 

输出前n项

def fib3(n, a=0, b=1):
     n -= 1if n < 0:
         returnprint(a, end=' ')
     fib3(n, b, a+b)