Leetcode: 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 TrieNode {
public:
    // Initialize your data structure here.
    TrieNode() {
        m_children.resize(26, nullptr);
        m_isWord = false;
    }
    
    ~TrieNode() {
        for (int i = 0; i < 26; ++i) {
            delete m_children[i];
        }
    }
    
    void insert(const string& word, int start) {
        if (start == word.size()) {
            m_isWord = true;
            return;
        }
        
        int idx = word[start] - 'a';
        if (m_children[idx] == nullptr) {
            m_children[idx] = new TrieNode();
        }
        m_children[idx]->insert(word, start + 1);
    }
    
    bool search(const string& word, int start) {
        if (start == word.size()) {
            return m_isWord;
        }
        
        if (word[start] == '.') {
            for (int i = 0; i < 26; ++i) {
                if (m_children[i] != nullptr && m_children[i]->search(word, start + 1)) {
                    return true;
                }
            }
        }
        else {
            int idx = word[start] - 'a';
            if (m_children[idx] != nullptr) {
                return m_children[idx]->search(word, start + 1);
            }
        }
        
        return false;
    }
    
private:
    vector<TrieNode*> m_children;
    bool m_isWord;
};

class WordDictionary {
public:
    // Adds a word into the data structure.
    void addWord(string word) {
        m_trieRoot.insert(word, 0);
    }

    // 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 m_trieRoot.search(word, 0);    
    }
    
private:
    TrieNode m_trieRoot;
};

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