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

请你设计一个数据结构，支持 添加新单词 和 查找字符串是否与任何先前添加的字符串匹配 。

实现词典类 WordDictionary ：

WordDictionary() 初始化词典对象
void addWord(word) 将 word 添加到数据结构中，之后可以对它进行匹配
bool search(word) 如果数据结构中存在字符串与 word 匹配，则返回 true ；否则，返回 false 。word 中可能包含一些 ‘.’ ，每个 . 都可以表示任何一个字母。

示例：

输入：
["WordDictionary","addWord","addWord","addWord","search","search","search","search"]
[[],["bad"],["dad"],["mad"],["pad"],["bad"],[".ad"],["b.."]]
输出：
[null,null,null,null,false,true,true,true]

解释：
WordDictionary wordDictionary = new WordDictionary();
wordDictionary.addWord("bad");
wordDictionary.addWord("dad");
wordDictionary.addWord("mad");
wordDictionary.search("pad"); // return False
wordDictionary.search("bad"); // return True
wordDictionary.search(".ad"); // return True
wordDictionary.search("b.."); // return True

class Node{
public:
    Node(bool isword){
        isWord=isword;
    }
    Node(){
        isWord= false;
    }

    int get(char c){
        if(next.find(c)==next.end()){
            return 0;//不存在
        }
        return 1;//存在
    }
    bool isWord;
    map<char,Node*>next;
};

class WordDictionary {
public:
    /** Initialize your data structure here. */
    WordDictionary() {
        root=new Node;
    }
    
    /** Adds a word into the data structure. */
    void addWord(string word) {
        int n=word.length();
        Node*cur=root;
        for(int i=0;i<n;i++){
            char c=word[i];
            //不存在则添加
            if(cur->get(c)==0){
                cur->next[c]=new Node;
            }
            cur=cur->next[c];
        }
        if(cur->isWord==false){
            cur->isWord= 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 match(root,word,0);
    }

private:
    bool match(Node *node,string word,int index){
        if(index==word.length()){
            return node->isWord;
        }
        
        char c=word[index];
        if(c!='.'){
            if(node->get(c)==0){
                return false;
            }
            return match(node->next[c],word,index+1);
        }
        else{
            for(map<char,Node*>::iterator it=node->next.begin();it!=node->next.end();it++){
                if(match(it->second,word,index+1)){
                    return true;
                }
            }
        }
        return false;
    }


    Node*root;
    int size;
};

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

class Node{
    public:
    Node(){
        isWord=false;
        for(int i=0;i<26;i++){
            next[i]=NULL;
        } 
    }
    bool isWord;
    Node* next[26];
};

class WordDictionary {
public:
    /** Initialize your data structure here. */
    WordDictionary() {
        root=new Node;
    }
    
    /** Adds a word into the data structure. */
    void addWord(string word) {
        int n=word.length();
        Node*cur=root;
        for(int i=0;i<n;i++){
            char c=word[i];
            if(cur->next[c-'a']==NULL){
                cur->next[c-'a']=new Node[26];
            }
            cur=cur->next[c-'a'];
        }
        cur->isWord= 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 match(root,word,0);
    }

private:
    bool match(Node *node,string word,int index){
        if(index==word.length()){
            return node->isWord;
        }
        char c=word[index];
        if(c!='.'){
            //cout<<node->next[c-'a']<<" ";
            if(node->next[c-'a']==NULL){
                return false;
            }
            return match(node->next[c-'a'],word,index+1);
        }
        else{
            for(int i=0;i<26;i++){
                if(node->next[i]&&match(node->next[i],word,index+1)){
                    return true;
                }
            }
        }
        return false;
    }


    Node*root;
};

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