Skip to main content

Trie - Question 2

 Leetcode 211. Design Add and Search Words Data Structure

Design a data structure that supports adding new words and finding if a string matches any previously added string.

Implement the WordDictionary class:

WordDictionary() Initializes the object.

void addWord(word) Adds word to the data structure, it can be matched later.

bool search(word) Returns true if there is any string in the data structure that matches word or false otherwise. word may contain dots '.' where dots can be matched with any letter.

Constraints:

1 <= word.length <= 500

word in addWord consists lower-case English letters.

word in search consist of  '.' or lower-case English letters.

At most 50000 calls will be made to addWord and search.


Analysis:

This question asks to build a word dictionary, which essentially a trie.

So we can define a node structure which has 26 children and a Boolean to label whether a string (or prefix) a word or not.

With this node structure, we can build a trie containing all the words. For each letter in the word, we move down one layer in the trie.

After building the trie, we can do the search, to determine whether a string is in the trie or not. Since the input string has wildcard (*), so recursive solution becomes suitable. The key to recursive solution is: the same question but a smaller size.


See the code below:


class WordDictionary {
struct node {
    vector<node*> nds;
    bool isW;
    node() {
        nds.resize(26);
        isW = false;
    }
};
public:
    /** Initialize your data structure here. */
    WordDictionary() {
        root = new node();
    }
    
    void addWord(string word) {
        node* p = root;
        for(auto &a : word) {
            int id = a - 'a';
            if(!p->nds[id]) p->nds[id] = new node();
            p = p->nds[id];
        }
        p->isW = true;
    }
    
    bool search(string word) {
        return isV(root, word);
    }
private:
    node* root;
    bool isV(node* p, string word) {
        if(word.empty()) return p->isW;
        if(word[0] != '.') {
            int id = word[0] - 'a';
            if(!p->nds[id]) return false;
            return isV(p->nds[id], word.substr(1));
        }
        for(auto &a : p->nds) {
            if(a && isV(a, word.substr(1))) 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);
 */


Upper Layer

Comments

Popular posts from this blog

Trie

Trie is a data structure belonging to n-ary trees, which is designed for some specific questions, such as, prefix of strings. (If you have never known what binary tree is, maybe you can check binary tree first before read more about Trie). The fact that there are only 26 different letters greatly reduce the possible choices for each position. Or to make it clear, for each position, there are 26 different choices. In mathematics, it seems to be very large (height^26 for the full tree), but in reality, it is rare to be a full tree for the set of meaningful strings (needs at least height^26 strings to be a full tree!), since the height or length of English words are less than 10 in most cases. Therefore, it is popular in string matching or related operations. Please be noted that the trie structure is not only limited to strings, the same idea can be extended to other data types, such as integer (then it becomes a binary tree, since for bit, there are only two possible values). In the cod...

Stack - Question 1

Questions: We have an integer array with size n. The index of the first number is 0, and the last one is n-1. For each number, please find the index of the first number higher than it on the right side. If there is no such number, return -1. Constains: 1 <= n <= 10^5 Analysis: If we fix each number, then run a for loop for all the numbers on its right side in the array, we can find the first number that is larger. But the time complexity would be O(N^2) overall. We need to find a solution that runs faster. A stack can be used for this: since we are looking for the first element higher on the right side, we can maintain a monotonically decreasing order inside the stack. When scanning to a new number,  1. if the stack is empty or the top element (the end of the numbers in the stack) is larger, just put the new number in the stack. Since the new number is smaller, the numbers in the stack still decreases; 2. if the stack is not empty and the top element is smaller than the new n...