## 题目描述 给你一个产品数组 products 和一个字符串 searchWord ，products  数组中每个产品都是一个字符串。 请你设计一个推荐系统，在依次输入单词 searchWord 的每一个字母后，推荐 products 数组中前缀与 searchWord 相同的最多三个产品。如果前缀相同的可推荐产品超过三个，请按字典序返回最小的三个。 请你以二维列表的形式，返回在输入 searchWord 每个字母后相应的推荐产品的列表。 ## 示例 **示例 1:** **输入:** products = ["mobile","mouse","moneypot","monitor","mousepad"], searchWord = "mouse" **输出:** [ ["mobile","moneypot","monitor"], ["mobile","moneypot","monitor"], ["mouse","mousepad"], ["mouse","mousepad"], ["mouse","mousepad"] ] **解释:** 按字典序排序后的产品列表是 ["mobile","moneypot","monitor","mouse","mousepad"] **示例 2:** **输入:** products = ["havana"], searchWord = "havana" **输出:** [["havana"],["havana"],["havana"],["havana"],["havana"],["havana"]] **示例 3:** **输入:** products = ["bags","baggage","banner","box","cloths"], searchWord = "bags" **输出:** [["baggage","bags","banner"],["baggage","bags","banner"],["baggage","bags"],["bags"]] **示例 4:** **输入:** products = ["havana"], searchWord = "tatiana" **输出:** [[],[],[],[],[],[],[]] ## 约束条件 1 <= products.length <= 1000 1 <= Σ products[i].length <= 2 * 10^4 products[i] 中所有的字符都是小写英文字母。 1 <= searchWord.length <= 1000 searchWord 中所有字符都是小写英文字母。 ## LeetCode 链接 https://leetcode.cn/problems/search-suggestions-system/