[LeetCode] 748. Shortest Completing Word

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.

题目描述

licensePlate 中包含数字，大小写字母，要求在words 数组中找到包含 licensePlate 所有字符的并且是最短的第一个word

C++ 实现

class Solution 
{
public:
    string shortestCompletingWord(string licensePlate, vector<string>& words) {
        const string license = findLowercaseLetters(licensePlate);
        // 由于是找第一个，所以使用stable sort, size 小的word 排在前面，使用匿名函数实现比较器        
        stable_sort(words.begin(),words.end(),[](const string& lhs,const string& rhs)
                    {
                        return lhs.size() < rhs.size();
                    });
        // 遍历words,返回第一个匹配的
        for (const string& word : words)
        {
            if (wordMatchLicense(word,license))
            {
                return word;
            }
        }

        return "";
    }
private:
    // 对licensePlate string 过滤，只剩下小写字母
    string findLowercaseLetters(const string& licensePlate)
    {
        string res = "";
        for (const char c : licensePlate)
        {
            if (isalpha(c))
            {
                res += tolower(c);
            }
        }
        return res;
    }
    // 查看word 是否和 License 匹配
    bool wordMatchLicense(const string& word,const string& license)
    {
        // 由于都是小写字母，使用长度为26的数组实现hash 表的功能
        vector<int> map(26,0);
        for (const char c : word)
        {
            map[c - 'a']++;
        }
        for (const char c : license)
        {
            // 如果license 中的字符有没在word 出现，或者出现字数不够的，直接返回false
            if(--map[c - 'a'] < 0)
            {
                return false;
            }
        }
        return true;
    }
};