python 斐波那契数列缓存方式实现

#!/usr/bin/env python3
# -*- coding: utf-8 -*-

' a test module '

__author__ = 'Zhang Shuai'
from functools import wraps
import  time
def memory(func):
l = {}
@wraps(func)
def wrap(n):
if n not in l:    #若以经计算过直接在list中返回，没有则计算
l
= func(n)
return l

return wrap
@memory
def fib(n):
time.clock()
if 1<n<=3:
return 1
elif n==1:
return 0
else:
return fib(n-1) +fib(n-2)
print(time.clock())
print(fib(100))
print(time.clock())