//trie树适用于快速存储和查询字符串数组
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 1e5+10;
int son[N][26],idx,cnt[N];
char s[N];
void insert(char *mh)
{
int p=0;
for (int i=0;mh[i];i++)
{
int u = mh[i]-'a';
if (!son[p][u]) son[p][u] = ++idx;
p = son[p][u];
}
cnt[p]++;
}
int query(char *mh)
{
int p=0;
for (int i=0;mh[i];i++)
{
int u = mh[i]-'a';
if (!son[p][u]) return 0;
p = son[p][u];
}
return cnt[p];
}
int main()
{
int n;
scanf("%d", &n);
while (n -- )
{
char mh[2];
scanf("%s%s",mh,s);
if (*mh=='I') insert(s);
else
printf ("%d\n",query(s));
}
return 0;
}
Tire树模板
最新推荐文章于 2022-01-02 20:36:27 发布