LeetCode|Add and Search Word - Data structure design

最新推荐文章于 2021-05-01 06:37:49 发布

DouMiaoO_Oo

最新推荐文章于 2021-05-01 06:37:49 发布

阅读量428

点赞数

分类专栏： LeetCode 文章标签： leetcode Trie

本文链接：https://blog.csdn.net/DouMiaoO_Oo/article/details/51471794

版权

LeetCode 专栏收录该内容

73 篇文章 0 订阅

订阅专栏

Add and Search Word - Data structure design

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.

class WordDictionary {
public:
    WordDictionary(){
        root = new Node();
    }
    // Adds a word into the data structure.
    void addWord(string word) {
        int len = word.length();
        Node* p = root;
        for(int i = 0; i < len; i++){
            int id = word[i] - 'a';
            if(p->next[id] == NULL) p->next[id] = new Node();
            p = p->next[id];
        } p->someWordCompleteHere = 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 dfs(word, root, 0);
    }

private:
    struct Node{
        Node(){
            someWordCompleteHere = false;
            memset(next, NULL, sizeof(next));
        }
        bool someWordCompleteHere;   
        Node *next[26];
    } * root;
    bool dfs(string& word, Node* p, int i){
        if(i == word.length()) return p->someWordCompleteHere;
        int id = -1;
        if(word[i] != '.') id = word[i] - 'a';
        if(id != -1){
            if(p->next[id] == NULL) return false;
            else return dfs(word, p->next[id], i+1);
        }
        for(int id = 0; id < 26; id++){
            if(p->next[id] != NULL && dfs(word, p->next[id], i+1)) return true;
        } return false;
    }
};

// Your WordDictionary object will be instantiated and called as such:
// WordDictionary wordDictionary;
// wordDictionary.addWord("word");
// wordDictionary.search("pattern");