• En
  • Signup
  • 刷题上岸
  • Today 0
  • Post 12
  • Followed 1
  • 捐助

    请在小工具里添加二维码

    刷题上岸 刷题上岸 关注:1 内容:12

    1268. Search Suggestions System

  • 查看作者
  • 打赏作者
  • 拉黑名单
    • 刷题上岸
    • 等级6
      土豪
      Share

      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[i].length <= 2 * 10^4

      • All characters of products[i] 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[str], searchWord: str) -> List[List[str]]:
              res = []
              product = products.sort() 
              for i in range(1,len(searchWord)+1):
                  temp = []
                  for each in products:
                      if each[0:i] == searchWord[0:i] and len(temp) <3:
                          temp.append(each)
                        
                  res.append(temp)
                      
              return res

      请登录之后再进行评论

      登录
    • Tasks
    • Current Activities
    • Back to Top