엔지니어 게시판
LeetCode 솔루션 분류

[6/19] 1268. Search Suggestions System

작성자 정보

  • mingki 작성
  • 작성일

컨텐츠 정보

본문

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.

관련자료

댓글 1

학부유학생님의 댓글

  • 학부유학생
  • 작성일
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
전체 126 / 1 페이지
게시글 쓰기
번호
제목
이름

최근글


새댓글


Stats


  • 현재 접속자 75 명
  • 오늘 방문자 632 명
  • 어제 방문자 683 명
  • 최대 방문자 1,262 명
  • 전체 회원수 264 명
알림 0