老师，怎么在 Jupyter Lab 上设置查看函数的执行时间？

from functools import lru_cache @lru_cache def factorial(n): if n < 2: return 1 elif n == 10: return 3628800 elif n == 100: return 93326215443944152681699238856266700490715968264381621468592963895217599993229915608941463976156518286253697920827223758251185210916864000000000000000000000000 else: return n *fabi(n-1) print(factorial(100))

from functools import lru_cache @lru_cache() def factorial(n): if n == 0: return 1 return n*factorial(n-1) print(factorial(100))

from functools import lru_cache @lru_cache(maxsize=None) # maxsize设置为None表示无限制的缓存大小 def factorial(n): if n == 0: return 1 else: return n * factorial(n - 1) print(factorial(10)) print(factorial(100))

# 使用缓存来存储已经计算过的阶乘结果 factorial_cache = {} def factorial(n): # 如果n已经计算过，直接返回缓存中的结果 if n in factorial_cache: return factorial_cache[n] # 计算阶乘 result = 1 for i in range(1, n + 1): result *= i # 将计算结果存入缓存 factorial_cache[n] = result return result print(factorial(10)) print(factorial(100))

# 编写一个能够计算 100 以内阶乘的函数，已知 60% 的人经常计算 10 和 100 的阶乘，请在此前提下优化阶乘函数 def factorial_100(n:int): if n == 10: return 3628800 elif n == 100: return 9.3326215e+157 else: result = 1 for i in range(1, n+1): result *= i return result print(factorial_100(100))

@lru_cache() def funJQ(n): if n==0 or n==1: return 1 return funJQ(n-1)*n funJQ(400)

'''用LRU算法 + 直接使用已知数据 优化算法''' from functools import lru_cache @lru_cache() def factorial(n): n_10 = 3628800 n_100 = 93326215443944152681699238856266700490715968264381621468592963895217599993229915608941463976156518286253697920827223758251185210916864000000000000000000000000 # N >=100，用100的结果作为初始值 if n >= 100 : if n == 100: return n_100 return n*factorial(n-1) # 10 <= 10 < 100，用10的结果作为初始 if n >= 10: if n == 10: return n_10 return n*factorial(n-1) # 0<= N <10，用0的结果作为初始 if n == 0: return 1 return n*factorial(n-1) print(factorial(101))

from functools import lru_cache @lru_cache() def factorial(n): if n == 1 or n == 0: return 1 elif n == 10: return 3628800; elif n == 100: return 93326215443944152681699238856266700490715968264381621468592963895217599993229915608941463976156518286253697920827223758251185210916864000000000000000000000000; else: return factorial(n-1) * n n = int(input("请输入：")) print(f"{n}的阶乘是：{factorial(n)}")