列表方法定义:
def fibonaqie(num):
fibs=[0,1] #把前两个定义了
for i in range(num-2): # 已经定了的两个数据
fibs.append(fibs[-2]+fibs[-1]) # 添加最后两个数据的和
print(fibs)
fibonaqie(10)
使用yield实现
def fibo(num):
a,b= 0,1
n=0
while n< num:
yield b
# print(b)
a,b = b,a+b
n+=1
# print(next(fibo(19)))
for i in fibo(10):
print(i)
使用while循环
def func(n):
a,b=0,1
i=0
l=[]
while i <n:
l.append(a)
a,b = b,b+a
i+=1
return l
print(func(15))