题目描述(传送门)
请你设计一个数据结构,支持 添加新单词 和 查找字符串是否与任何先前添加的字符串匹配 。
实现词典类 WordDictionary :
WordDictionary() 初始化词典对象
void addWord(word) 将 word 添加到数据结构中,之后可以对它进行匹配
bool search(word) 如果数据结构中存在字符串与 word 匹配,则返回 true ;否则,返回 false 。word 中可能包含一些 ‘.’ ,每个 . 都可以表示任何一个字母。
示例:
输入:
["WordDictionary","addWord","addWord","addWord","search","search","search","search"]
[[],["bad"],["dad"],["mad"],["pad"],["bad"],[".ad"],["b.."]]
输出:
[null,null,null,null,false,true,true,true]
解释:
WordDictionary wordDictionary = new WordDictionary();
wordDictionary.addWord("bad");
wordDictionary.addWord("dad");
wordDictionary.addWord("mad");
wordDictionary.search("pad"); // return False
wordDictionary.search("bad"); // return True
wordDictionary.search(".ad"); // return True
wordDictionary.search("b.."); // return True
解题思路
添加
添加应该和正常的前缀树添加是一样的,不在赘述
搜索
需要进行回溯算法。
代码
class WordDictionary {
private WordDictionary[] wordDictionaries;
boolean isEnd;
/**
* Initialize your data structure here.
*/
public WordDictionary() {
wordDictionaries = new WordDictionary[26];
isEnd = false;
}
public void addWord(String word) {
WordDictionary node = this;
for (int i = 0; i < word.length(); i++) {
char ch = word.charAt(i);
int index = ch - 'a';
// 检查是否存在
if (node.wordDictionaries[index] == null) {
// 不存在则直接开辟新的节点
node.wordDictionaries[index] = new WordDictionary();
}
node = node.wordDictionaries[index];
}
node.isEnd = true;
}
public boolean search(String word) {
WordDictionary node = this;
return searchHelper(node, word,0);
}
private boolean searchHelper(WordDictionary node, String word, int index) {
// 递归出口,递归到单词结尾返回
if (index == word.length()) {
return node.isEnd;
}
// 情况一
if (word.charAt(index) == '.') {
for (int i = 0; i < 26; i++) {
if (node.wordDictionaries[i] != null && searchHelper(node.wordDictionaries[i], word, index+1)) {
return true;
}
}
// 情况二
} else {
if (node.wordDictionaries[word.charAt(index) - 'a'] != null && searchHelper(node.wordDictionaries[word.charAt(index) - 'a'], word, index+1)) {
return true;
}
}
return false;
}
}