Python Memoization手动缓存

def memoize(func):
    cache = {}

    def wrapper(*args):
        if args not in cache:
            cache[args] = func(*args)
        return cache[args]

    return wrapper

@memoize
def fibonacci(n):
    if n < 2:
        return n
    return fibonacci(n-1) + fibonacci(n-2)

print(fibonacci(10))  # 输出 55

def memoize_with_limit(max_size):
    def decorator(func):
        cache = {}
        keys = []

        def wrapper(*args):
            if args not in cache:
                if len(keys) >= max_size:
                    oldest_key = keys.pop(0)
                    del cache[oldest_key]
                cache[args] = func(*args)
                keys.append(args)
            return cache[args]

        return wrapper
    return decorator

@memoize_with_limit(100)
def fibonacci(n):
    if n < 2:
        return n
    return fibonacci(n-1) + fibonacci(n-2)

print(fibonacci(10))  # 输出 55