Trie树，又叫字典树，前缀树(Prefix Tree)，单词查找树，是一种多叉树的结构. {"a","apple","appeal","appear","bee","beef","cat"} 深色表示接受态 关键字集合{"pool", "prize", "prepare", "preview",
示例代码 def fun(a, b, c, d): nums = [] for num in range(a, b): nums.append(lambda: num ** c) return nums[d]() print(fun(1, 5, 2, 0)) print(fun(1, 5, 2, 1
