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

题目意思理解了很久，其实题目简单，就是感觉描述没有说清楚。

求解words字典列表中含licensePlate字母的单词（只管字母，不管数字、空格等其他符号，如licensePlate = “ls3 PSt”，那么字母就是s P S t），如果字典列表中有多个，则返回字符串长度最短的即可。程序如下所示：

class Solution {
    public String shortestCompletingWord(String licensePlate, String[] words) {
        int[] ch = new int[26];
        licensePlate = licensePlate.toLowerCase();
        int len = licensePlate.length();
        int l = 0;
        for (int i = 0; i < len; ++ i){
            if (licensePlate.charAt(i) >= 'a' && licensePlate.charAt(i) <= 'z'){
                ch[licensePlate.charAt(i) - 'a'] ++;
                l ++;
            }
        }
        int minLen = Integer.MAX_VALUE;
        String res = "";
        for (String s : words){
            int[] t = new int[26];
            int size = s.length();
            for (int i = 0; i < size; ++ i){
                t[s.charAt(i) - 'a'] ++;
            }
            int m = 0;
            for (int i = 0; i < 26; ++ i){
                if (ch[i] <= t[i]){
                    m += ch[i];
                }                
            }
            if (m == l){
                if (minLen > size){
                    minLen = size;
                    res = s;
                }
            }
        }
        return res;
    }
}