LeetCode 솔루션 분류
[6/19] 1268. Search Suggestions System
본문
Medium
2674146Add to ListShareYou 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"]]
Constraints:
1 <= products.length <= 10001 <= products[i].length <= 30001 <= sum(products[i].length) <= 2 * 104- All the strings of
productsare unique. products[i]consists of lowercase English letters.1 <= searchWord.length <= 1000searchWordconsists of lowercase English letters.
태그
#Amazon, #Google, #Oracle, #Facebook, #Adobe, #Microsoft, #Apple, #Goldman Sachs, #Bloomberg, #Wix, #Array, #String, #Trie
관련자료
-
링크
댓글 2
학부유학생님의 댓글
- 익명
- 작성일
class Solution:
def suggestedProducts(self, products: List[str], searchWord: str) -> List[List[str]]:
products = sorted(products)
search = ""
result = []
starting_index = 0
for i in range(len(searchWord)):
search += searchWord[i]
suggestions = []
for j in range(starting_index, len(products)):
if search == products[j][:i+1]:
if not suggestions:
starting_index = j
suggestions.append(products[j])
if len(suggestions) == 3:
break
result.append(suggestions.copy())
return resultCoffee님의 댓글
- 익명
- 작성일
class Solution {
public List<List<String>> suggestedProducts(String[] products, String searchWord) {
Arrays.sort(products);
int start = 0;
int end = products.length-1;
List<List<String>> result = new ArrayList<>();
for(int i=0; i<searchWord.length(); i++){
while(start < products.length && (products[start].length() <= i || products[start].charAt(i) != searchWord.charAt(i))){
start++;
}
while(end >= 0 && (products[end].length() <= i || products[end].charAt(i) != searchWord.charAt(i))){
end--;
}
// if does not match at all
if(start > end){
for(int j=i; j<searchWord.length(); j++){
result.add(new ArrayList<>());
}
return result;
}
// add upto 3 words
List<String> temp = new ArrayList<>();
for(int k=0; k<Math.min(3, end-start + 1); k++){
temp.add(products[start+k]);
}
result.add(temp);
}
return result;
}
}
