Trie (2) -- Add and Search Word - Data structure design

最新推荐文章于 2019-11-22 20:03:48 发布

dwt0317

最新推荐文章于 2019-11-22 20:03:48 发布

阅读量270

点赞数

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

本文链接：https://blog.csdn.net/dwt0317/article/details/54745307

版权

leetcode 专栏收录该内容

40 篇文章 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.

在Trie树的基础上对于查询函数做一些修改，遇到 '.' 时遍历所有可能的子树、

class WordDictionary {
public:
    struct TrieNode{
        bool isWord;
        TrieNode* nextBranch[26];
        TrieNode(): isWord(false){
            memset(nextBranch, NULL, sizeof(nextBranch));
        }
    };
    TrieNode* root;
    /** Initialize your data structure here. */
    WordDictionary() {
        root = new TrieNode();
    }

    /** Adds a word into the data structure. */
    void addWord(string word) {
        TrieNode* p = root;
        for (char c : word){
            int index = c - 'a';  //Ascii(a) = 97
            if (p -> nextBranch[index] == NULL){
                p = p -> nextBranch[index] = new TrieNode();
            }
            else p = p -> nextBranch[index];
        }
        p -> 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 searchSubstr(word, root);
    }

    bool searchSubstr(string subword, TrieNode* p){
        int n = subword.size();
        for (int i = 0; i < n && p != NULL; i++){
            if (subword[i] != '.'){
                int index = subword[i] - 'a';
                p = p -> nextBranch[index];
            }
            else{
                for (int j = 0; j < 26; j++){
                    if (p -> nextBranch[j] != NULL){
                        if (searchSubstr(subword.substr(i+1, n-i), p->nextBranch[j]))
                            return true;
                    }
                }
                return false;
            }
        }
        return p && p -> isWord;
    }
};