Leetcode 211. Add and Search Word - Data structure design Trie树 + dfs

211. Add and Search Word - Data structure design
     Medium

766

48

Favorite

Share
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
Note:
You may assume that all words are consist of lowercase letters a-z.

Accepted
109,809
Submissions
368,705

解析： 首先加单词就是一个典型的建Trie的过程，查找过程，可能会复杂很多，所以只能去试，将点替换为a-z然后再去查找，看最后是否能到Trie树的底部。

代码：

class TrieNode
{
public:
    TrieNode*  child[26];
    bool is_word;
    TrieNode():is_word(false)
    {
        for(int i = 0; i < 26; i++) 
            child[i] = nullptr;
    }
};

class WordDictionary 
{
private:    
    TrieNode* root;
public:
    /** Initialize your data structure here. */
    WordDictionary() 
    {
        root = new TrieNode();
    }
    
    /** Adds a word into the data structure. */
    void addWord(string word) 
    {
        TrieNode* p = root;
        int len = word.length();
        for(int i = 0; i < len; i++)
        {
            int ch = word[i] - 'a';
            if(!p->child[ch]) p->child[ch] = new TrieNode();
            p = p->child[ch];
        }
        p->is_word = true;
    }
    
    /** Returns if the word is in the data structure. A word could contain the dot character '.' to represent any one letter. */
    bool search(string word) 
    {
       return search(word.c_str(), root);
    }

    bool search(const char* word, TrieNode* root)
    {
        if(!root) return false;
        if(*word =='\0') return root->is_word;
        if(*word!='.') return search(word+1, root->child[*word-'a']);
        else 
        {
            for(int i = 0 ; i < 26; i++) 
                if(search(word+1, root->child[i])) return true;
            return false;
        }
    }
};

/**
 * Your WordDictionary object will be instantiated and called as such:
 * WordDictionary* obj = new WordDictionary();
 * obj->addWord(word);
 * bool param_2 = obj->search(word);
 */