748. Shortest Completing Word
来源:互联网 发布:电磁炉 知乎 编辑:程序博客网 时间:2024/06/01 20:16
Find the minimum length word from a given dictionary words, which has all the letters from the string licensePlate. Such a word is said to complete the given string licensePlate
Here, for letters we ignore case. For example, “P” on the licensePlate still matches “p” on the word.
It is guaranteed an answer exists. If there are multiple answers, return the one that occurs first in the array.
The license plate might have the same letter occurring multiple times. For example, given a licensePlate of “PP”, the word “pair” does not complete the licensePlate, but the word “supper” does.
Example 1:
Input: licensePlate = "1s3 PSt", words = ["step", "steps", "stripe", "stepple"]
Output: "steps"
Explanation: The smallest length word that contains the letters "S", "P", "S", and "T".
Note that the answer is not "step", because the letter "s" must occur in the word twice.
Also note that we ignored case for the purposes of comparing whether a letter exists in the word.
Example 2:
Input: licensePlate = "1s3 456", words = ["looks", "pest", "stew", "show"]
Output: "pest"
Explanation: There are 3 smallest length words that contains the letters "s".
We return the one that occurred first.
Note:
licensePlate will be a string with length in range [1, 7].
licensePlate will contain digits, spaces, or letters (uppercase or lowercase).
words will have a length in the range [10, 1000].
Every words[i] will consist of lowercase letters, and have length in range [1, 15].
Hint:
要找包含给出模板所有字母的最短单词,可以使用哈希表记录模板中每个字母的个数,再对应每个单词中每个字母出现的个数,如果后者中每个字母出现个数大于或等于前者,则改单词是完全包含模板的,找出其中长度最短的即可。
class Solution {public: string shortestCompletingWord(string licensePlate, vector<string>& words) { licensePlate = toLower(licensePlate); int mymap[26]; for (int i = 0; i < 26; i++) { mymap[i] = 0; } for (int i = 0; i < licensePlate.length(); i++) { if (licensePlate[i] <= 'z' && licensePlate[i] >= 'a') { mymap[licensePlate[i]-'a']++; } } string result; int minlength = 1001; for (auto word : words) { if (matched(word, mymap) && word.length() < minlength) { minlength = word.length(); result = word; } } return result; } bool matched(string word, int* mymap) { int tmap[26]; for (int i = 0; i < 26; i++) { tmap[i] = mymap[i]; } for (int i = 0; i < word.length(); i++) { tmap[word[i]-'a']--; } for (int i = 0; i < 26; i++) { if (tmap[i] > 0 ) { return false; } } return true; } string toLower(string s) { for (int i = 0; i < s.length(); i++) { if (s[i] >= 'A' && s[i] <= 'Z') { s[i] = s[i]-'A'+'a'; } } return s; }};
- 748. Shortest Completing Word
- 748. Shortest Completing Word
- 748. Shortest Completing Word(C++)
- LWC 63:748. Shortest Completing Word
- LeetCode | 748. Shortest Completing Word12_17
- leetcode--Shortest Word Distance
- Leetcode: Shortest Word Distance
- *LeetCode-Shortest Word Distance
- [leetcode243] Shortest Word Distance
- Shortest Word Distance
- Shortest Word Distance II
- Shortest Word Dsitance III
- [LeetCode243]Shortest Word Distance
- LeetCode Shortest Word Distance
- Leetcode243: Shortest Word Distance
- Leetcode Shortest Word Distance
- Shortest Word Distance
- word ladder - shortest path
- ros下diy手臂rviz演示抓取放置
- Objective-C Runtime 运行时(4)
- EVE-NG升级后提示WARNING:neither Intel VT-x or AMD-V found
- c作业题12.06
- week_11_ Permutations
- 748. Shortest Completing Word
- java设计模式之建造者模式
- 抽象类和接口的区别
- Partition to K Equal Sum Subsets
- 数据结构实验之查找三:树的种类统计
- Java中那些晦涩难懂的名词(不定时更新)
- 4、构建 Instrumented 单元测试
- leetcode 347[medium]--Top K Frequent Elements
- 最新glide库Android studio 2.X无法使用