Design a data structure that supports the following two operations:
void addWord(word) bool search(word)
search(word) can search a literal word or a regular expression string containing only letters a-z
or .
. A .
means it can represent any one letter.
Example:
addWord("bad") addWord("dad") addWord("mad") search("pad") -> false search("bad") -> true search(".ad") -> true search("b..") -> true
思路:
其实依旧是用trie, 用TrieNode数组存起每个字母,然后判断是不是isword,只是在搜索时由于通配符可以适配任一个字符,所以需要采用回溯的方法。匹配到当前字符时,如果遇到’.’,那么就找任一个子孩子,尝试继续寻找下去。
public class WordDictionary {
public class TrieNode{
TrieNode[]children = new TrieNode[26];
boolean isWord ;
}
private TrieNode root = new TrieNode();
/** Initialize your data structure here. */
// public WordDictionary() {
// }
/** Adds a word into the data structure. */
public void addWord(String word) {
TrieNode node = root;
for (char c : word.toCharArray()) {
if (node.children[c - 'a'] == null) {
node.children[c - 'a'] = new TrieNode();
}
node = node.children[c - 'a'];
}
node.isWord = true;
}
/** Returns if the word is in the data structure. A word could contain the dot character '.' to represent any one letter. */
public boolean search(String word) {
return match(word.toCharArray(), 0,root);
}
public boolean match(char[] chs , int k, TrieNode node){
if(k == chs.length){
return node.isWord ;
}
if(chs[k]=='.'){
for(int i=0;i<node.children.length;i++){
if(node.children[i] != null&& match(chs, k+1,node.children[i])){
return true;
}
}
}else{
return (node.children[chs[k]-'a'] != null&& match(chs, k+1,node.children[chs[k]-'a']));
}
return false;
}
}