最短能够覆盖给定字符串的单词，Shortest Completing Word

2019独角兽企业重金招聘Python工程师标准>>>

问题：

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  :

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

解决：

【题意】

给你一个由字母和数字组成的licensePlate。另外给你一组单词，让你找一个最短的单词能够覆盖住车牌中的字母（不考虑大小写）。如果有多个解，输出第一个解。

①  使用hash table，直接解决。

class Solution { //17ms
    public String shortestCompletingWord(String licensePlate, String[] words) {
        String target = licensePlate.toLowerCase();
        int[] hash = new int[26];
        for (char c : target.toCharArray()){
            if (Character.isLetter(c)){
                hash[c - 'a'] ++;
            }
        }
        int minLen = Integer.MAX_VALUE;
        String res = null;
        for (String word : words){
            word = word.toLowerCase();
            if (match(word,hash) && word.length() < minLen){
                minLen = word.length();
                res = word;
            }
        }
        return res;
    }
    public boolean match(String word,int[] hash){
        int[] tmp = new int[26];
        for (char c : word.toCharArray()){
            if (Character.isLetter(c)){
                tmp[c - 'a'] ++;
            }
        }
        for (int i = 0;i < 26;i ++){
            if (hash[i] != 0 && tmp[i] < hash[i]) return false;
        }
        return true;
    }
}

转载于:https://my.oschina.net/liyurong/blog/1616704