[Leetcode] 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].

思路：

感觉这道题目的难度应该是easy级别的才对（第一次犯贱一下^_^）。我们首先统计words中每个单词中每个字母的出现次数，然后存储在二维数组中。接着统计licensePlate中的每种字母的出现次数。最后就是在二维数组中查找包含licensePlate中的所有字母，并且长度最小的单词了。

代码：

class Solution {
public:
    string shortestCompletingWord(string licensePlate, vector<string>& words) {
        vector<vector<int>> counts(words.size(), vector<int>(26, 0));
        for (int i = 0; i < words.size(); ++i) {        // construct the hash map for words
            for (char &c : words[i]) {
                ++counts[i][tolower(c) - 'a'];
            }
        }
        vector<int> hash(26, 0);                        // calculate the char counts in licensePlate
        for (char &c : licensePlate) {
            if (isalpha(c)) {
                ++hash[tolower(c) - 'a'];
            }
        }
        int min_length = INT_MAX, min_index = -1;       // find the one that has the smallest length
        for (int i = 0; i < counts.size(); ++i) {
            int j;
            for (j = 0; j < 26; ++j) {
                if (hash[j] > counts[i][j]) {
                    break;
                }
            }
            if (j == 26 && words[i].length() < min_length) {
                min_length = words[i].length();
                min_index = i;
            }
        }
        return words[min_index];
    }
};