斐波那契数列
##递归方式
"""斐波那契函数:1,1,2,3,5,8.."""
def fib(index):
if index <= 2:
return 1
else:
return fib(index-1)+fib(index-2)
##普通方式
def fib(index):
re_list = []
n,a,b = 0,0,1
while n < index:
re_list.append(b)
a,b = b,a+b
n += 1
return re_list
##生成器函数
def gen_fib(index):
n,a,b = 0,0,1
while n < index:
yield b
a,b = b,a+b
n += 1
for data in gen_fib(5):
print(data)