Trie

struct Node 
{
    map<char, Node*> children;
    bool is_end_of_word;

    Node() : is_end_of_word(false) {}
    Node(char key, Node* next) : is_end_of_word(false) { children.insert(map<char, Node*>::value_type(key, next)); }
};

class Trie
{
public:
    Trie(void);
    ~Trie(void);
    void tire_insert(const string& input);
    bool tire_search(const string& input);
    Node* get_root() { return root_; }
private :
    void clear_node(Node* node);
    Node* root_;
};
Trie::Trie(void)
{
    root_ = new Node();
}

void Trie::clear_node(Node* node)
{
    if (node->children.size() == 0)
        delete node;
    else {
        for (int i = 0; i < node->children.size(); i++)
            clear_node(node->children.at(i));
    }
}


Trie::~Trie(void)
{
    clear_node(root_);
}

void Trie::tire_insert(const string& input)
{
    Node* tmp = root_;
    for (int i = 0; i < input.size(); i++) {
        char c = input.at(i);
        if (tmp->children.find(c) == tmp->children.end()) {
            tmp->children.insert(map<char, Node*>::value_type(c, new Node()));
        }
        tmp = tmp->children.at(c);
        if (i == input.size() - 1) {
            tmp->is_end_of_word = true;
        }
    }
}
bool Trie::tire_search(const string& input)
{
    Node* tmp = root_;
    for (int i = 0; i < input.size(); i++) {
        char c = input.at(i);
        if (tmp->children.find(c) != tmp->children.end()) {
            tmp = tmp->children.at(c);
        }
        else {
            return false;
        }
    }
    return tmp->is_end_of_word;

}

int main()
{
    Trie tire;
    tire.tire_insert(string("abc"));
    tire.tire_insert(string("abc"));
    tire.tire_insert(string("abcd"));
    tire.tire_insert(string("dfsfsfewr"));

    cout << tire.tire_search(string("abcd")) << endl;
    cout << tire.tire_search(string("dfsfsfewr")) << endl;
    cout << tire.tire_search(string("abcd")) << endl;
    cout << tire.tire_search(string("abc")) << endl;
    cout << tire.tire_search(string("ab")) << endl;

    system("pause");
    return 0;
}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 1
    评论
评论 1
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值