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"]

Example 2:

Input: products = ["havana"], searchWord = "havana"
Output: [["havana"],["havana"],["havana"],["havana"],["havana"],["havana"]]

Example 3:

Input: products = ["bags","baggage","banner","box","cloths"], searchWord = "bags"
Output: [["baggage","bags","banner"],["baggage","bags","banner"],["baggage","bags"],["bags"]]

class Solution:
    def suggestedProducts(self, products: List[str], searchWord: str) -> List[List[str]]:
        
        #In a sorted list of words,
        #for any word A[i],
        #all its suggested words must following this word in the list.
        #For example, if A[i] is a prefix of A[j],
        #A[i] must be the prefix of A[i + 1], A[i + 2], ..., A[j]
        #Explanation
        #With this observation,
        #we can binary search the position of each prefix of search word,
        #and check if the next 3 words is a valid suggestion.
        # we can use a algorithm called binary search within a sorted array
        products.sort()
        #先把products排个序，才能进行二分
        # res is the list of result, prefix represent every prefix, i represent the index of product in products//res是最后输出的list， prefix前缀，i代表products的index
        res, prefix, i = [], "", 0
        #遍历traverse searchWord的每一个字母//traverse every word in searchWord
        for c in searchWord:
            #prefix一个一个加   add word in prefix one by one
            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
            #注意！w在一个list里
            res.append([w for w in products[i:i+3] if w.startswith(prefix)])
        return res
            
    
        #Complexity
        #Time O(NlogN) for sorting
        #Space O(logN) for quick sort.

        #Time O(logN) for each query
        #Space O(query) for each query
        #where I take word operation as O(1)