中文字典树

#ifndef CHINESETRIETREE_H
#define CHINESETRIETREE_H




struct Node {
    map<string,Node *> child;
    int num;
    int value;
    Node(){
        num=0;
    }
};

class TrieTree{
private:
    Node *root;
    int flag;
public:
    TrieTree(){
        root=new Node();
    }
    int insert(string s,int val){
        if(root==NULL||s=="")return -1;
        int len=s.size(),i=0;
        Node *p=root;
        while(i<len){
            string sub=s.substr(i,i+3);
            map<string,Node *>::iterator it= p->child.find(sub);
            if(it==p->child.end()){
                Node *x=new Node();
                p->child.insert(make_pair(sub,x));
                p=x;
            } else {
                p->num++;
                p=it->second;
            }
            i+=3;
        }
        p->value=val;
        return val;
    }
    int find(string s){
       if(root==NULL||s=="")return -1;
        int len=s.size(),i=0;
        Node *p=root;
        while(i<len){
            string sub=s.substr(i,i+3);
            map<string,Node *>::iterator it= p->child.find(sub);
            if(it==p->child.end()){
                return -1;
            } else {
                p=it->second;
            }
            i+=3;
        }
        return p->value;
    }
};

#endif