前缀树问题

前缀树问题判别

前缀树问题一般性质：多个字符串存在共同前缀，该共同前缀对结果有影响。

前缀树通用解决方案：

class Trie{
   
public:
    Trie() {
   
        isEnd = false;
        memset(next, 0, sizeof(next));
    }
    void insert(string word) {
   
        auto node = this;
        for(auto w : word) {
   
            if(node->next[w-'a'] == NULL) {
   
                node->next[w-'a'] = new Trie();
            }
            node = node->next[w-'a'];
        }
        node->isEnd = true;
    }
    bool search(string word) {
   
        auto node = this;
        for(auto w : word) {
   
            if(node->next[w-'a'] == NULL) {
   
                return false;
            }
            node = node->next[w-'a'];
        }
        return node->isEnd;
    }
    bool startWith(string word) {
   
        auto node = this;
        for(auto w : word) {
   
            if(node->next[w-'a'] == NULL) {
   
                return false;
            }
            node = node->next[w-'a'];
        }
        return true;
    }
private:
    //  判断当前字符是否字符串末尾
    bool isEnd;
    //  26个小写字母
    Trie *next[26];
}

例题

Leetcode 208.实现前缀树

class Trie {
   
public:
    /** Initialize your data structure here. */
    Trie() {
   
        isEnd = false;
        memset(next, 0, sizeof(next));
    }
    
    /** Inserts a word into the trie. */
    void insert(string word) {
   
        auto node = this;
        for(auto w : word) {
   
            if(node->next[w-'a'] == NULL) {
   
                node->next[w-'a'] = new Trie();
            }
            node = node->next[w-'a'];
        }
        node->isEnd = true;
    }
    
    /** Returns if the word is in the trie. */
    bool search(string word) {
   
        auto node = this;
        for(auto w : word) {
   
            if(node->next[w-'a'] == NULL