亚麻-1268. Search Suggestions System

You are given an array of strings products and a string searchWord.

Design a system that suggests at most three product names from products after each character of searchWord is typed. Suggested products should have common prefix with searchWord. If there are more than three products with a common prefix return the three lexicographically minimums products.

Return a list of lists of the suggested products after each character of searchWord is typed.

Example 1:

Input: products = ["mobile","mouse","moneypot","monitor","mousepad"], searchWord = "mouse"
Output: [["mobile","moneypot","monitor"]，["mobile","moneypot","monitor"]，["mouse","mousepad"]，["mouse","mousepad"]，["mouse","mousepad"]]

Explanation: products sorted lexicographically = ["mobile","moneypot","monitor","mouse","mousepad"]
After typing m and mo all products match and we show user ["mobile","moneypot","monitor"]
After typing mou, mous and mouse the system suggests ["mouse","mousepad"]

class Solution:
    def suggestedProducts(self, products: List[str], searchWord: str) -> List[List[str]]:
        products.sort() #先把products排个序，才能进行二分
        #res是最后输出的list， prefix前缀，i代表products的index
        res, prefix, i = [], '', 0
        #遍历traverse searchWord的每一个字母
        for c in searchWord:
            #prefix一个一个加
            prefix += c
            #bisect.bisect_left(a, x, lo=0, hi=len(a))这是一个二分查找
            # i是start位置，默认len（a）是end位置
            # 如果 x 已经在 a 里存在，那么插入点会在已存在元素之前（也就是左边）
            # 获得一个product的index i
            i = bisect.bisect_left(products, prefix, i)
            # 如果结果超过3个，就取前三个，所以i + 3
            res.append([w for w in products[i:i + 3] if w.startswith(prefix)])
        return res