【Leetcode_easy】748. Shortest Completing Word

problem

748. Shortest Completing Word

题意：

solution1:

class Solution {
public:
    string shortestCompletingWord(string licensePlate, vector<string>& words) {
        string res = "";
        unordered_map<char, int> freq;
        int total = 0;
        for(char ch : licensePlate)
        {
            if(ch>='a' && ch<='z') { freq[ch]++; total++; }
            else if(ch>='A' && ch<='Z') { freq[ch+32]++; total++; }
        }
        
        for(auto word:words)
        {
            int cnt = total;
            unordered_map<char, int> t = freq;
            for(auto ch:word)
            {
                if(t[ch] > 0) { cnt--; t[ch]--; }//err...
            }
            if(cnt==0 && (res.empty() || res.size()>word.size())) res = word;
        }
        return res;
        
    }
};

solution2:

 

 

 

参考

1. Leetcode_easy_748. Shortest Completing Word;

2. Grandyang;

完