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

Post a Comment

Popular posts from this blog

Brute Force - Question 2

2105. Watering Plants II Alice and Bob want to water n plants in their garden. The plants are arranged in a row and are labeled from 0 to n - 1 from left to right where the ith plant is located at x = i. Each plant needs a specific amount of water. Alice and Bob have a watering can each, initially full. They water the plants in the following way: Alice waters the plants in order from left to right, starting from the 0th plant. Bob waters the plants in order from right to left, starting from the (n - 1)th plant. They begin watering the plants simultaneously. It takes the same amount of time to water each plant regardless of how much water it needs. Alice/Bob must water the plant if they have enough in their can to fully water it. Otherwise, they first refill their can (instantaneously) then water the plant. In case both Alice and Bob reach the same plant, the one with more water currently in his/her watering can should water this plant. If they have the same amount of water, then Alice ...
Post a Comment
Read more

Sliding Window - Question 1

Leetcode 76. Minimum Window Substring Given two strings s and t of lengths m and n respectively, return the minimum window substring of s such that every character in t (including duplicates) is included in the window. If there is no such substring, return the empty string "". The testcases will be generated such that the answer is unique. A substring is a contiguous sequence of characters within the string. Constraints: m == s.length n == t.length 1 <= m, n <= 10^5 s and t consist of uppercase and lowercase English letters. Analysis: The first step to do is to count the letters in string t, since the relative order of chars does not matter. After the counting, we can use two pointers method on string s: starting with beginning of the string s, the second pointer can continue to move until the sub-string [i, j) has all the chars in t, where i the index of the first pointer, and j is the index of the second pointer. We are looking for the sub-string with the minimum leng...
Post a Comment
Read more