208. 实现 Trie (前缀树)

实现一个 Trie (前缀树)，包含 insert, search, 和 startsWith 这三个操作。

示例:

Trie trie = new Trie();

trie.insert("apple");
trie.search("apple");   // 返回 true
trie.search("app");     // 返回 false
trie.startsWith("app"); // 返回 true
trie.insert("app");   
trie.search("app");     // 返回 true

说明:

你可以假设所有的输入都是由小写字母 a-z 构成的。
保证所有输入均为非空字符串。

class Node{
    public:
    Node(){
        isWord=false;
        for(int i=0;i<26;i++){
            next[i]=NULL;
        } 
    }
    bool isWord;
    Node* next[26];
};

class Trie {
public:
    /** Initialize your data structure here. */
    Trie() {
        root=new Node;
    }
    
    /** Inserts a word into the trie. */
    void insert(string word) {
        int n=word.length();
        Node*cur=root;
        for(int i=0;i<n;i++){
            char c=word[i];
            if(cur->next[c-'a']==NULL){
                cur->next[c-'a']=new Node[26];
            }
            cur=cur->next[c-'a'];
        }
        cur->isWord= true;
    }
    
    /** Returns if the word is in the trie. */
    bool search(string word) {
        int n=word.length();
        Node*cur=root;
        for(int i=0;i<n;i++){
            char c=word[i];
            if(cur->next[c-'a']==NULL){
                return false;
            }
            cur=cur->next[c-'a'];
        }
        return  cur->isWord;
    }
    
    /** Returns if there is any word in the trie that starts with the given prefix. */
    bool startsWith(string prefix) {
        int n=prefix.length();
        Node*cur=root;
        for(int i=0;i<n;i++){
            char c=prefix[i];
            if(cur->next[c-'a']==NULL){
                return false;
            }
            cur=cur->next[c-'a'];
        }
        return  true;
    }
private:
    Node *root;
};

/**
 * Your Trie object will be instantiated and called as such:
 * Trie* obj = new Trie();
 * obj->insert(word);
 * bool param_2 = obj->search(word);
 * bool param_3 = obj->startsWith(prefix);
 */

class Node{
public:
    Node(bool isword){
        isWord=isword;
    }
    Node(){
        isWord= false;
    }

    int get(char c){
        if(next.find(c)==next.end()){
            return 0;//不存在
        }
        return 1;//存在
    }
    bool isWord;
    map<char,Node*>next;
};

class Trie {
public:
    /** Initialize your data structure here. */
    Trie() {
        root=new Node;
    }
    
    /** Inserts a word into the trie. */
    void insert(string word) {
        int n=word.length();
        Node*cur=root;
        for(int i=0;i<n;i++){
            char c=word[i];
            //不存在则添加
            if(cur->get(c)==0){
                cur->next[c]=new Node;
            }
            cur=cur->next[c];
        }
        if(cur->isWord==false){
            cur->isWord= true;
        }
    }
    
    /** Returns if the word is in the trie. */
    bool search(string word) {
        int n=word.length();
        Node*cur=root;
        for(int i=0;i<n;i++){
            char c=word[i];
            if(cur->get(c)==0){
                return false;
            }
            cur=cur->next[c];
        }
        return  cur->isWord;

    }
    
    /** Returns if there is any word in the trie that starts with the given prefix. */
    bool startsWith(string prefix) {
        int n=prefix.length();
        Node*cur=root;
        for(int i=0;i<n;i++){
            char c=prefix[i];
            if(cur->get(c)==0){
                return false;
            }
            cur=cur->next[c];
        }
        return true;

    }
private:
    Node*root;
    int size;
};

/**
 * Your Trie object will be instantiated and called as such:
 * Trie* obj = new Trie();
 * obj->insert(word);
 * bool param_2 = obj->search(word);
 * bool param_3 = obj->startsWith(prefix);
 */