leetcode--211. 添加与搜索单词 - 数据结构设计

211. 添加与搜索单词 - 数据结构设计
     设计一个支持以下两种操作的数据结构：

void addWord(word)
bool search(word)
search(word) 可以搜索文字或正则表达式字符串，字符串只包含字母 . 或 a-z 。 . 可以表示任何一个字母。

示例:

addWord(“bad”)
addWord(“dad”)
addWord(“mad”)
search(“pad”) -> false
search(“bad”) -> true
search(".ad") -> true
search(“b…”) -> true
说明:

你可以假设所有单词都是由小写字母 a-z 组成的。

class WordDictionary {
private:
    bool isEnd = false;
    WordDictionary* next[26] = {NULL};
public:
    /** Initialize your data structure here. */
    WordDictionary() {

    }
    
    /** Adds a word into the data structure. */
    void addWord(string word) {
        WordDictionary* node = this;
        for (char c : word) {
            if (node->next[c-'a'] == NULL) {
                node->next[c-'a'] = new WordDictionary();
            }
            node = node->next[c-'a'];
        }
        node->isEnd = 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 searchWord(this, word);
    }
    bool searchWord(WordDictionary* node, string word) {
        //base case
        if (word.size() == 1) {
            if (isalpha(word[0])) {
                if (node->next[word[0]-'a'] && node->next[word[0]-'a']->isEnd) return true;
                return false;
            } else {
                for (int i=0; i<26; i++) {
                    if (node->next[i] && node->next[i]->isEnd) return true;
                }
                return false;
            }
        } else {
            if (isalpha(word[0])) {
                if (node->next[word[0]-'a']) return searchWord(node->next[word[0]-'a'], word.substr(1, word.size()-1));
                else return false;
            } else {
                bool flag = false;
                for (int i=0; i<26; i++) {
                    if (node->next[i]) {
                        flag = searchWord(node->next[i], word.substr(1, word.size()-1));
                        if(flag) 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);
 */
 /*220ms,76.6MB*/

优化版本：

bool searchWord(WordDictionary* node, string word) {
        for (int i=0; i<word.size(); i++) {
            if (word[i] == '.') {
                for (int j=0; j<26; j++) {
                    if (node->next[j]) {
                        if (searchWord(node->next[j], word.substr(i+1))) return true;
                    }
                }
                return false;
            }
            if (node->next[word[i]-'a'] == NULL) return false;
            node = node->next[word[i]-'a'];
        }
        return node->isEnd;
    }
/*172ms,42.8MB*/

参考链接：
https://leetcode-cn.com/problems/add-and-search-word-data-structure-design/solution/c-qian-zhui-shu-hui-su-by-code_rain/
https://leetcode-cn.com/problems/add-and-search-word-data-structure-design/solution/xiang-xi-tong-su-de-si-lu-fen-xi-duo-jie-fa-by–43/