LeetCode-Shortest Completing Word

最新推荐文章于 2021-04-04 19:29:34 发布

BeHelium

最新推荐文章于 2021-04-04 19:29:34 发布

阅读量173

点赞数

分类专栏： LeetCode 文章标签： LeetCode Java

本文链接：https://blog.csdn.net/qq_24133491/article/details/83818051

版权

LeetCode 专栏收录该内容

306 篇文章 0 订阅

订阅专栏

Description：
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:

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

题意：给定一个包含字母和数字的字符串licensePlate和一个字符串数组words，在words中找出包含字符串licensePlate中的所有字母（忽略大小写）的那个字符串（如果有多个，返回长度最短并且是第一个出现的）；

解法：首先，要计算一个字符串A是否包含了字符串B中的所有字符（字符可以重复），可以利用哈希表存储字符串B后再遍历字符串A，每次对应的键值减1，如果不存在这个键，那自然就不满足了；这是对words中的一个字符串的计算过程，遍历words中的所有字符串，重复利用上述的方法，找出包含其所有字母的字符串，并且是长度最短（存在多个，返回第一次出现的那个）；

Java

class Solution {
    public String shortestCompletingWord(String licensePlate, String[] words) {
        String license = "";
        String result  = "";
        for (int i = 0; i < licensePlate.length(); i++) {
            char ch = licensePlate.charAt(i);
            if (Character.isLetter(ch)) license += Character.toLowerCase(ch);
        }
        for (String word: words) {
            HashMap<Character, Integer> hm = new HashMap<>();
            for (int i = 0; i < word.length(); i++) {
                hm.put(word.charAt(i), hm.getOrDefault(word.charAt(i), 0) + 1);
            }
            int cnt = 0;
            for (int i = 0; i < license.length(); i++) {
                char ch = license.charAt(i);
                hm.put(ch, hm.getOrDefault(ch, 0) - 1);
                if (hm.get(ch) < 0) break;
                cnt++;
            }
            if (cnt == license.length()) {
                if ("".equals(result) || word.length() < result.length()) result = word;
            }
        }
        return result;
    }
}