748. Shortest Completing Word（python+cpp）

题目：

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 thelicensePlate 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 alicensePlateof "PP", the word "pair" does not complete thelicensePlate, 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:
licensePlate will be a string with length in range [1, 7].
licensePlate will contain digits, spaces, or letters (uppercase or lowercase).
words will have a length in the range [10, 1000].
Every words[i] will consist of lowercase letters, and have length in range [1, 15].

解释：
题目太长不想看。
以前写的速度非常慢的python解法：

from collections import Counter
class Solution(object):
    def shortestCompletingWord(self, licensePlate, words):
        """
        :type licensePlate: str
        :type words: List[str]
        :rtype: str
        """
        pattern=[ x for x in licensePlate.lower() if x.isalpha()]
        pattern_dict=Counter(pattern)
        i=0
        result=[]
        _len=16
        while i<len(words):
            word_dict=Counter(words[i])
            count=0
            for key in pattern_dict.keys():
                if word_dict.get(key,0)>=pattern_dict[key]:
                    count+=1
            if count==len(pattern_dict.keys()):
                result.append(words[i])
                _len=min(_len,len(words[i]))
            i+=1
        return [x for x in result if len(x)==_len][0]

用了排序和Counter()的python代码：

from collections import Counter
class Solution(object):
    def shortestCompletingWord(self, licensePlate, words):
        """
        :type licensePlate: str
        :type words: List[str]
        :rtype: str
        """
        words=sorted(words,key=lambda x:len(x))
        count=Counter([x.lower() for x in licensePlate if x.isalpha()])
        for word in words:
            #深层拷贝
            cpy_count=dict(count)
            for letter in word:
                if letter in cpy_count and cpy_count[letter]>0:
                    cpy_count[letter]-=1
            if sum(cpy_count.values())==0:
                return word

总结：
注意python的深拷贝和浅拷贝，import copy