是Python递归实现斐波那契数列,说实话有费内存,求40位我电脑跑了一分钟
#斐波那契数列,
def fun(a):
if a==1:
return 1
elif a==2:
return 1
else:
return fun(a-2)+fun(a-1)
# print(fun(39))
list = []
for i in range(1,10):
list.append(fun(i))
print(list)