public class WordDictionary {
Trier root=new Trier();
public void addWord(String word){
Trier pointer=root;
for(int i=0;i<word.length();i++){
char c=word.charAt(i);
if(pointer.children[c-'a']==null){
pointer.children[c-'a']=new Trier();
pointer=pointer.children[c-'a'];
}else{
pointer=pointer.children[c-'a'];
}
}
pointer.flag=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) {
Trier pointer=root;
return helper(word,0,pointer);
}
private boolean helper(String word,int start,Trier cur){
if(start==word.length()){
if(cur.flag) return true;
else return false;
}
char c=word.charAt(start);
if(c=='.'){
for(int i=0;i<26;i++){
if(cur.children[i]!=null)
if(helper(word,start+1,cur.children[i])) return true;
}
}else{
if(cur.children[c-'a']==null) return false;
else return helper(word,start+1,cur.children[c-'a']);
}
return false;
}
class Trier{
Trier[] children;
char c;
boolean flag;
public Trier(){
children=new Trier[26];
flag=false;
}
}
}
// Your WordDictionary object will be instantiated and called as such:
// WordDictionary wordDictionary = new WordDictionary();
// wordDictionary.addWord("word");
// wordDictionary.search("pattern");
211. Add and Search Word - Data structure design
最后编辑于 ：
©著作权归作者所有,转载或内容合作请联系作者
- 文/潘晓璐 我一进店门，熙熙楼的掌柜王于贵愁眉苦脸地迎上来，“玉大人，你说我怎么就摊上这事。” “怎么了？”我有些...
- 文/花漫 我一把揭开白布。 她就那样静静地躺着，像睡着了一般。 火红的嫁衣衬着肌肤如雪。 梳的纹丝不乱的头发上，一...
- 文/苍兰香墨 我猛地睁开眼，长吁一口气：“原来是场噩梦啊……” “哼！你这毒妇竟也来了？” 一声冷哼从身侧响起，我...
推荐阅读更多精彩内容
- Design a data structure that supports the following two o...
- Design a data structure that supports the following two o...
- Design a data structure that supports the following two o...
- Design a data structure that supports the following two o...
