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.
For example:
addWord("bad") addWord("dad") addWord("mad") search("pad") -> false search("bad") -> true search(".ad") -> true search("b..") -> true
Note:
You may assume that all words are consist of lowercase letters a-z
.
题目大意:设计一种数据结构,实现addWord和search操作,其中search操作中'.'可以匹配任何字符。
解题思路:这道题和LeetCode 208 Implement Trie类似,只不过多了一个如果当前字符为'.'的判断。
代码如下:
#define MAXN 27
typedef struct TrieNode{
struct TrieNode* next[MAXN];
} WordDictionary;
/** Initialize your data structure here. */
WordDictionary* wordDictionaryCreate() {
WordDictionary* root = malloc(sizeof(WordDictionary));
for(int i = 0;i < MAXN;i++){
root->next[i] = NULL;
}
return root;
}
/** Adds a word into the data structure. */
void wordDictionaryAddWord(WordDictionary* obj, char* word) {
if(strlen(word) == 0){
obj->next[26] = wordDictionaryCreate();
return ;
}
if(obj->next[*word - 'a']){
wordDictionaryAddWord(obj->next[*word - 'a'], word + 1);
}else{
obj->next[*word - 'a'] = wordDictionaryCreate();
wordDictionaryAddWord(obj->next[*word - 'a'], word + 1);
}
}
/** Returns if the word is in the data structure. A word could contain the dot character '.' to represent any one letter. */
bool wordDictionarySearch(WordDictionary* obj, char* word) {
if(strlen(word) == 0){
if(obj->next[26]) return true;
else return false;
}
if(*word == '.'){
for(int i = 0;i < MAXN;i++){
if(obj->next[i] && wordDictionarySearch(obj->next[i], word + 1)){
return true;
}
}
return false;
}
if(obj->next[*word - 'a']) return wordDictionarySearch(obj->next[*word - 'a'], word + 1);
else return false;
}
void wordDictionaryFree(WordDictionary* obj) {
if(obj){
for(int i = 0;i < MAXN;i++){
wordDictionaryFree(obj->next[i]);
}
free(obj);
}
}
/**
* Your WordDictionary struct will be instantiated and called as such:
* struct WordDictionary* obj = wordDictionaryCreate();
* wordDictionaryAddWord(obj, word);
* bool param_2 = wordDictionarySearch(obj, word);
* wordDictionaryFree(obj);
*/