748. Shortest Completing Word

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:

1. licensePlate will be a string with length in range [1, 7].
2. licensePlate will contain digits, spaces, or letters (uppercase or lowercase).
3. words will have a length in the range [10, 1000].
4. Every words[i] will consist of lowercase letters, and have length in range [1, 15].

方法1:

思路：

这道题问的是：一个7个字符长度的plate, 找出所有字母，换成小写，然后对所有word进行词频统计。然后每个字符进行比较，如果plate中某个字符数量不够，标记为incomplete。同时保证相同符合条件的单词长度最小（通过全球变量），同长度下最先出现（替换全球变量的条件是小于而不是小于等于）。

class Solution {
public:
    string shortestCompletingWord(string licensePlate, vector<string>& words) {
        vector<int> plate(26, 0);
        string res = string(16, '0');
        for (char c: licensePlate) {
            if (isalpha(c)){
                plate[tolower(c) - 'a']++; 
            }
        }
        
        for (string word: words) {
            vector<int> hash(26, 0);
            for (char c: word) hash[c - 'a']++;
            bool incomplete = false;
            for (int i = 0; i < 26; i++) {
                if (plate[i] > hash[i]) {
                    incomplete = true;
                    break;
                }
            }
            if (!incomplete && word.size() < res.size()) res = word; 
        }
        return res;
    }
};