dict1 = {}
def fibl(n):
if n == 0:
return 0
if n == 1:
return 1
return (fibl(n-1) if n-1 not in dict1 else dict1[n-1]) + (fibl(n-2) if n-2 not in dict1 else dict1[n-2])
def all_fib(n):
global dict1
res =[]
for i in range(n + 1):
req = fibl(i)
dict1[i] = req
res.append(req)
print(res)
all_fib(100000)
老师用的装饰器很高大上(看了好几遍才搞明白), 但是当数字大于995后会有超过递归深度报错, 所以过来皮一下/狗头
展开