LeetCode 솔루션

[6/19] 1268. Search Suggestions System

mingki 쪽지보내기 메일보내기 자기소개 아이디로 검색 전체게시물 작성
작성일 2022.06.18 23:24

6,458 조회
2 댓글
0 추천
0 비추천
목록 게시글 쓰기

Medium

2674146Add to ListShare

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

Constraints:

1 <= products.length <= 1000
1 <= products[i].length <= 3000
1 <= sum(products[i].length) <= 2 * 104
All the strings of products are unique.
products[i] consists of lowercase English letters.
1 <= searchWord.length <= 1000
searchWord consists of lowercase English letters.

#Amazon, #Google, #Oracle, #Facebook, #Adobe, #Microsoft, #Apple, #Goldman Sachs, #Bloomberg, #Wix, #Array, #String, #Trie

링크

https://leetcode.com/problems/search-suggestions-system/ 2117 회 연결

익명
작성일 2022.06.19 22:10

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 result

익명
작성일 2022.06.30 01:48

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;
    }
}

[code=java]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;
    }
}[/code]