字典树模板

最新推荐文章于 2024-07-21 22:29:27 发布

小k安达

最新推荐文章于 2024-07-21 22:29:27 发布

阅读量287

点赞数 1

CC 4.0 BY-SA版权

本文链接：https://blog.youkuaiyun.com/forever_kirito/article/details/76620722

acm_知识点总结同时被 2 个专栏收录

15 篇文章

订阅专栏

acm_字典树

8 篇文章

订阅专栏

本文详细介绍了动态与静态Trie树的数据结构实现方法，包括插入、删除、搜索及计数等核心操作，并提供了完整的C++代码示例。通过对比两种实现方式，帮助读者更好地理解Trie树的应用场景。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

动态树

code

#include <iostream>
using namespace std;
const int MAXM = 30,KIND = 26;
int m;
struct node
{
    char* s;
    int prefix;
    bool isword;
    node* next[KIND];
    node()
    {
        s = NULL;
        prefix = 0;
        isword = false;
        memset(next,0,sizeof(next));
    }
}*root;//根
void insert(node *root,char *s)//插入
{
    node *p = root;
    for (int i = 0;s[i];i++)
    {
        int x = s[i] - 'a';
        p->s = s+i;
        if (p->next[x] == NULL)
            p->next[x] = new node;
        p = p->next[x];
        p->prefix++;
    }
    p->isword = true;
}
bool del(node *root,char *s)//删除
{
    node *p = root;
    for (int i = 0;s[i];i++)
    {
        int x = s[i] - 'a';
        if (p->next[x] == NULL)
            return false;
        p = p->next[x];
    }
    if (p->isword)
        p->isword = false;
    else
        return false;
    return true;
}
bool search(node *root,char* s)//查找s这个字符串，是否出现过
{
    node* p = root;
    for (int i = 0;s[i];i++)
    {
        int x = s[i]-'a';
        if (p->next[x] == NULL)
            return false;
        p = p->next[x];
    }
    return p->isword;
}
int count(node *root,char *s)//统计以s作为前缀的字符串的个数
{
    node *p = root;
    for (int i = 0;s[i];i++)
    {
        int x = s[i] - 'a';
        if (p->next[x] == NULL)
            return 0;
        p = p->next[x];
    }
    return p->prefix;
}
int main()
{
    m = 0;
    root = new node;
    char s[MAXM];
    while (gets(s))
    {
        if (strcmp(s,"") == 0)
            break;
        insert(root,s);
    }
    while (gets(s))
        printf("%d\n",count(root,s));
}

///静态trie

code

#include <iostream>
using namespace std;
const int MAXN = 100010,MAXM = 30,KIND = 26;
int m;
struct node
{
    char* s;
    int prefix;
    bool isword;
    node* next[KIND];
    void init()
    {
        s = NULL;
        prefix = 0;
        isword = false;
        memset(next,0,sizeof(next));
    }
}a[MAXN*MAXM],*root;//根
void insert(node *root,char *s)
{
    node *p = root;
    for (int i = 0;s[i];i++)
    {
        int x = s[i] - 'a';
        p->s = s+i;
        if (p->next[x] == NULL)
        {
            a[m].init();
            p->next[x] = &a[m++];
        }
        p = p->next[x];
        p->prefix++;
    }
    p->isword = true;
}
bool del(node *root,char *s)
{
    node *p = root;
    for (int i = 0;s[i];i++)
    {
        int x = s[i] - 'a';
        if (p->next[x] == NULL)
            return false;
        p = p->next[x];
    }
    if (p->isword)
        p->isword = false;
    else
        return false;
    return true;
}
bool search(node *root,char* s)
{
    node* p = root;
    for (int i = 0;s[i];i++)
    {
        int x = s[i]-'a';
        if (p->next[x] == NULL)
            return false;
        p = p->next[x];
    }
    return p->isword;
}
int count(node *root,char *s)
{
    node *p = root;
    for (int i = 0;s[i];i++)
    {
        int x = s[i] - 'a';
        if (p->next[x] == NULL)
            return 0;
        p = p->next[x];
    }
    return p->prefix;
}
int main()
{
    m = 0;
    a[m].init();
    root = &a[m++];
    char s[MAXM];
    while (gets(s))
    {
        if (strcmp(s,"") == 0)
            break;
        insert(root,s);
    }
    while (gets(s))
        printf("%d\n",count(root,s));
}