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

题意：给出一个模式串和一个字符串字典，要求在字符串字典中包含了模式串中全部大小写字母，且长度最短的字符串。如果有多个字符串，则输出最先出现的字符串。这里注意不区分大小写。

class Solution {
public:
    int vis[26]={0};
    //记录当前最小串的长度和开始位置
    int minn=9999999,pos;
    string shortestCompletingWord(string licensePlate, vector<string>& words) {
        //统计模式串中各字母出现的次数 这里不区分大小写 
        for(int i=0;i<licensePlate.length();i++){
            if(licensePlate[i]>='a'&&licensePlate[i]<='z')
                vis[licensePlate[i]-'a']++;
            else if(licensePlate[i]>='A'&&licensePlate[i]<='Z')
                vis[licensePlate[i]-'A']++;
        }
        for(int i=0;i<words.size();i++){
            int flag=0;
            int cnt=0,aa[26];
            for(int k=0;k<26;k++)
                aa[k]=vis[k];
            // 匹配的字符串进行相减，最后与0比较即可。    
            for(int j=0;j<words[i].length();j++){
                if(words[i][j]>='a'&&words[i][j]<='z')
                    aa[words[i][j]-'a']--;
                else if(words[i][j]>='A'&&words[i][j]<='Z')
                    aa[words[i][j]-'A']--;
            }
            for(int k=0;k<26;k++){
                if(aa[k]>0){
                    flag=-1;
                    break;
                }
            }
            if(flag==0){
                if(words[i].length()<minn){
                    minn=words[i].length();
                    pos=i;
                }
            }
        }
        return words[pos];
    }
};