题目
标题和出处
标题:元音拼写检查器
出处:966. 元音拼写检查器
难度
7 级
题目描述
要求
给定单词列表 wordlist \texttt{wordlist} wordlist,我们想实现一个拼写检查器,将查询单词转换为正确的单词。
对于给定的查询单词 query \texttt{query} query,拼写检查器将会处理两类拼写错误:
- 大小写:如果查询匹配单词列表中的某个单词(不区分大小写),则返回的正确单词与单词列表中的大小写相同。
- 例如: wordlist = ["yellow"] \texttt{wordlist = ["yellow"]} wordlist = ["yellow"], query = "YellOw" \texttt{query = "YellOw"} query = "YellOw": correct = "yellow" \texttt{correct = "yellow"} correct = "yellow"
- 例如: wordlist = ["Yellow"] \texttt{wordlist = ["Yellow"]} wordlist = ["Yellow"], query = "yellow" \texttt{query = "yellow"} query = "yellow": correct = "Yellow" \texttt{correct = "Yellow"} correct = "Yellow"
- 例如: wordlist = ["yellow"] \texttt{wordlist = ["yellow"]} wordlist = ["yellow"], query = "yellow" \texttt{query = "yellow"} query = "yellow": correct = "yellow" \texttt{correct = "yellow"} correct = "yellow"
- 元音错误:如果在将查询单词中的元音(
‘a’
\texttt{`a'}
‘a’、
‘e’
\texttt{`e'}
‘e’、
‘i’
\texttt{`i'}
‘i’、
‘o’
\texttt{`o'}
‘o’、
‘u’
\texttt{`u'}
‘u’)分别替换为任何元音后,能与单词列表中的单词匹配(不区分大小写),则返回的正确单词与单词列表中的匹配项大小写相同。
- 例如: wordlist = ["YellOw"] \texttt{wordlist = ["YellOw"]} wordlist = ["YellOw"], query = "yollow" \texttt{query = "yollow"} query = "yollow": correct = "YellOw" \texttt{correct = "YellOw"} correct = "YellOw"
- 例如: wordlist = ["YellOw"] \texttt{wordlist = ["YellOw"]} wordlist = ["YellOw"], query = "yeellow" \texttt{query = "yeellow"} query = "yeellow": correct = "" \texttt{correct = ""} correct = ""(无匹配项)
- 例如: wordlist = ["YellOw"] \texttt{wordlist = ["YellOw"]} wordlist = ["YellOw"], query = "yllw" \texttt{query = "yllw"} query = "yllw": correct = "" \texttt{correct = ""} correct = ""(无匹配项)
此外,拼写检查器还按照以下优先级规则操作:
- 当查询完全匹配单词列表中的某个单词(区分大小写)时,应该返回相同的单词。
- 当查询匹配到大小写问题的单词时,应该返回单词列表中的第一个这样的匹配项。
- 当查询匹配到元音错误的单词时,应该返回单词列表中的第一个这样的匹配项。
- 如果该查询在单词列表中没有匹配项,则应该返回空字符串。
给出一些查询 queries \texttt{queries} queries,返回一个单词列表 answer \texttt{answer} answer,其中 answer[i] \texttt{answer[i]} answer[i] 是由查询 query = queries[i] \texttt{query = queries[i]} query = queries[i] 得到的正确单词。
示例
示例 1:
输入:
wordlist
=
["KiTe","kite","hare","Hare"],
queries
=
["kite","Kite","KiTe","Hare","HARE","Hear","hear","keti","keet","keto"]
\texttt{wordlist = ["KiTe","kite","hare","Hare"], queries = ["kite","Kite","KiTe","Hare","HARE","Hear","hear","keti","keet","keto"]}
wordlist = ["KiTe","kite","hare","Hare"], queries = ["kite","Kite","KiTe","Hare","HARE","Hear","hear","keti","keet","keto"]
输出:
["kite","KiTe","KiTe","Hare","hare","","","KiTe","","KiTe"]
\texttt{["kite","KiTe","KiTe","Hare","hare","","","KiTe","","KiTe"]}
["kite","KiTe","KiTe","Hare","hare","","","KiTe","","KiTe"]
示例 2:
输入:
wordlist
=
["yellow"],
queries
=
["YellOw"]
\texttt{wordlist = ["yellow"], queries = ["YellOw"]}
wordlist = ["yellow"], queries = ["YellOw"]
输出:
["yellow"]
\texttt{["yellow"]}
["yellow"]
数据范围
- 1 ≤ wordlist.length, queries.length ≤ 5000 \texttt{1} \le \texttt{wordlist.length, queries.length} \le \texttt{5000} 1≤wordlist.length, queries.length≤5000
- 1 ≤ wordlist[i].length, queries[i].length ≤ 7 \texttt{1} \le \texttt{wordlist[i].length, queries[i].length} \le \texttt{7} 1≤wordlist[i].length, queries[i].length≤7
- wordlist[i] \texttt{wordlist[i]} wordlist[i] 和 queries[i] \texttt{queries[i]} queries[i] 仅由英语字母组成
解法
思路和算法
为了实现拼写检查器的功能,需要使用一个哈希集合用于寻找完全匹配的单词,以及两个哈希表分别用于寻找忽略大小写的情况下匹配的单词和忽略元音的情况下匹配的单词,以下将这两个哈希表分别称为大小写哈希表和元音哈希表。
遍历单词列表,对于单词列表中的每个单词,执行以下操作:
-
对于完全匹配,将原始单词加入哈希集合;
-
对于忽略大小写的情况下的匹配,将单词转成小写,然后将转成小写之后的单词和原始单词存入大小写哈希表;
-
对于忽略元音的情况下的匹配,将单词中的所有元音使用点号替换,然后将替换元音之后的单词和原始单词存入元音哈希表。
由于匹配规则要求在忽略大小写和忽略元音的情况下匹配时应该返回单词列表中的第一个符合要求的匹配项,因此在将单词列表中的每个单词存入两个哈希表时,应确保同一个处理过的单词(指转成小写或者替换元音)只存入哈希表一次。如果若干个单词转成小写之后的结果相同,则只有第一个单词会存入大小写哈希表;如果若干个单词替换元音之后的结果相同,则只有第一个单词会存入元音哈希表。
将单词列表中的每个单词存入哈希集合与两个哈希表之后,即可对每个查询单词进行匹配。匹配操作如下:
-
如果查询单词在哈希集合中,则查询结果为查询单词;
-
否则,将查询单词转成小写,如果转成小写之后的查询单词在大小写哈希表中,则从大小写哈希表中得到查询单词对应的单词,查询结果为该对应的单词;
-
否则,将查询单词中的所有元音使用点号替换,如果替换元音之后的查询单词在元音哈希表中,则从元音哈希表中得到查询单词对应的单词,查询结果为该对应的单词;
-
否则,查询单词在单词列表中没有匹配项,查询结果为空字符串。
代码
class Solution {
public String[] spellchecker(String[] wordlist, String[] queries) {
Set<String> match = new HashSet<String>();
Map<String, String> matchIgnoreCase = new HashMap<String, String>();
Map<String, String> matchIgnoreVowel = new HashMap<String, String>();
for (String word : wordlist) {
match.add(word);
String wordLower = word.toLowerCase();
matchIgnoreCase.putIfAbsent(wordLower, word);
String ignoreVowel = ignoreVowel(wordLower);
matchIgnoreVowel.putIfAbsent(ignoreVowel, word);
}
int length = queries.length;
String[] answer = new String[length];
for (int i = 0; i < length; i++) {
String query, queryLower, queryLowerIgnoreVowel;
if (match.contains(query = queries[i])) {
answer[i] = query;
} else if (matchIgnoreCase.containsKey(queryLower = query.toLowerCase())) {
answer[i] = matchIgnoreCase.get(queryLower);
} else if (matchIgnoreVowel.containsKey(queryLowerIgnoreVowel = ignoreVowel(queryLower))) {
answer[i] = matchIgnoreVowel.get(queryLowerIgnoreVowel);
} else {
answer[i] = "";
}
}
return answer;
}
public String ignoreVowel(String str) {
char[] array = str.toCharArray();
int length = array.length;
for (int i = 0; i < length; i++) {
if (isVowel(array[i])) {
array[i] = '.';
}
}
return new String(array);
}
public boolean isVowel(char c) {
return c == 'A' || c == 'E' || c == 'I' || c == 'O' || c == 'U' || c == 'a' || c == 'e' || c == 'i' || c == 'o' || c == 'u';
}
}
复杂度分析
-
时间复杂度: O ( m + n ) O(m + n) O(m+n),其中 m m m 是单词列表 wordlist \textit{wordlist} wordlist 的长度, n n n 是查询列表 queries \textit{queries} queries 的长度。需要遍历单词列表一次,将每个单词存入哈希集合与两个哈希表,然后需要遍历查询列表一次,对于每个查询单词得到查询结果,对于单词列表和查询列表中的每个单词,哈希表操作的时间都是 O ( 1 ) O(1) O(1)。这里将字符串操作的时间视为 O ( 1 ) O(1) O(1)。
-
空间复杂度: O ( m ) O(m) O(m),其中 m m m 是单词列表 wordlist \textit{wordlist} wordlist 的长度。需要使用哈希集合存储单词列表中的全部单词,使用两个哈希表分别记录单词列表中的每个单词转成小写和替换元音之后的单词和原始单词的对应关系。这里将字符串占用的空间视为 O ( 1 ) O(1) O(1)。注意返回值不计入空间复杂度。