怎么递归实现斐波拉契数例
1:简单版的
def simple_fib(n):
if n < 2:
return n
return fib(n - 1) + fib(n - 2)
对其性能测试:
if __name__ == '__main__':
start_time = time.time()
print fib(150)
end_time =time.time()
print('call cost time =%s' % (end_time - start_time))
直接卡死,花费时间都输不出来
2:装饰器版本
def memo(fn):
cache = {}
miss = object()
def wrapper(*args</