0748. Shortest Completing Word

# 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）长度在区间 [10, 1000] 中。
• 每一个单词 words[i] 都是小写，并且长度在区间 [1, 15] 中。

## 解题思路 #

• 给出一个数组，要求找出能包含 `licensePlate` 字符串中所有字符的最短长度的字符串。如果最短长度的字符串有多个，输出 word 下标小的那个。这一题也是简单题，不过有 2 个需要注意的点，第一点，`licensePlate` 中可能包含 `Unicode` 任意的字符，所以要先把字母的字符筛选出来，第二点是题目中保证了一定存在一个最短的单词能满足题意，并且忽略大小写。具体做法按照题意模拟即可。

## 代码 #

``````
package leetcode

import "unicode"

func shortestCompletingWord(licensePlate string, words []string) string {
var ret string
for _, w := range words {
if match(lp, w) {
if len(w) < len(ret) || ret == "" {
ret = w
}
}
}
return ret
}

func genCnter(lp string) [26]int {
cnter := [26]int{}
for _, ch := range lp {
if unicode.IsLetter(ch) {
cnter[unicode.ToLower(ch)-'a']++
}
}
return cnter
}

func match(lp [26]int, w string) bool {
m := [26]int{}
for _, ch := range w {
m[ch-'a']++
}
for k, v := range lp {
if m[k] < v {
return false
}
}
return true
}

``````

Apr 8, 2023