Leetcode 1268. Search Suggestions System
本帖最后由 Seawolf 于 2020-9-5 04:13 编辑Given an array of strings products and a string searchWord. We want to 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 the searchWord. If there are more than three products with a common prefix return the three lexicographically minimums products.
Return 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"]]
Example 4:
Input: products = ["havana"], searchWord = "tatiana"
Output: [[],[],[],[],[],[],[]]
Constraints:
1 <= products.length <= 1000
There are no repeated elements in products.
1 <= Σ products.length <= 2 * 10^4
All characters of products are lower-case English letters.
1 <= searchWord.length <= 1000
All characters of searchWord are lower-case English letters.
class Solution:
def suggestedProducts(self, products: List, searchWord: str) -> List]:
if products == None or len(products) == 0:
return []
products.sort()
prefix = ''
res = []
for i in range(len(searchWord)):
prefix += searchWord
temp = []
for j in range(len(products)):
curtStr = products
if curtStr.startswith(prefix):
temp.append(curtStr)
if len(temp) == 3:
break
res.append(temp)
return res
class TrieNode:
def __init__(self):
self.children = collections.defaultdict(TrieNode)
self.suggestion_list = []
class Trie:
def __init__(self):
self.root = TrieNode()
def add_word(self, word: str):
curt = self.root
for letter in word:
curt = curt.children
if len(curt.suggestion_list) < 3:
curt.suggestion_list.append(word)
class Solution:
def suggestedProducts(self, products: List, searchWord: str) -> List]:
if products == None or len(products) == 0:
return []
node = Trie()
products.sort()
res = []
for product in products:
curt = node
curt.add_word(product)
curt = node.root
for char in searchWord:
curt = curt.children
res.append(curt.suggestion_list)
return res
Binary Search
class Solution:
def suggestedProducts(self, A, word):
A.sort()
res, prefix, i = [], '', 0
for c in word:
prefix += c
i = bisect.bisect_left(A, prefix, i)
res.append( if w.startswith(prefix)])
return res
页:
[1]