题目
解法1:trie
把products里面的所有单词建立成一个trie,每个trie节点下面有一个word list,代表到这个节点为止的prefix,有哪些单词满足条件.然后就遍历searchword即可
class TrieNode:
def __init__(self):
self.childs = {
}
self.words = []
class Solution:
def suggestedProducts(self, products: List[str], searchWord: str) -> List[List[str]]:
products.sort()
root = TrieNode()
for prod in products