lru_cache 缓存计算真的是太省时间了

from functools import lru_cache

@lru_cache
def fibonacci(n):
    print(n)
    if n == 1 or n == 2:
        return 1
    return fibonacci(n-1) + fibonacci(n-2)

if __name__ == '__main__':
    print(fibonacci(30))
    print('-----')
    print(fibonacci(30))

30
29
28
27
26
25
24
23
22
21
20
19
18
17
16
15
14
13
12
11
10
9
8
7
6
5
4
3
2
1
832040
-----
832040