这题内存需求很大,我用静态数组写的trie总MLE,看discuss说50w的数组才过,但我一开50w的就MLE了啊……想不通
这是链表版的trie,1个case,所以也不用考虑内存释放什么的
#include<cstdio>
#include<cstring>
#include<cstdlib>
using namespace std;
struct trie
{
struct trie *son[26];
int n;
}*root;
inline int idx(char &a)
{
return a-'a';
}
void insert(char *s)
{
int i,j;
struct trie *c,*newnode;
c=root;
for(i=0;s[i];i++)
{
if(c->son[idx(s[i])]!=0)
{
c=c->son[idx(s[i])];
c->n++;
}
else
{
newnode=(struct trie *)malloc(sizeof(struct trie));
for(j=0;j<26;j++) newnode->son[j]=0;
c->son[idx(s[i])]=newnode;
c=newnode;
c->n=1;
}
}
}
int find(char *s)
{
int i;
int len;
struct trie *c;
len=strlen(s);
if(len==0) return 0;
c=root;
for(i=0;i<len;i++)
{
if(c->son[idx(s[i])]!=0)
{
c=c->son[idx(s[i])];
}
else return 0;
}
return c->n;
}
int main()
{
char a[11];
int i;
root=(struct trie *)malloc(sizeof(struct trie));
for(i=0;i<26;i++) root->son[i]=0;
root->n=0;
while(gets(a),strcmp(a,"")!=0)
insert(a);
while(gets(a)!=0)
printf("%d\n",find(a));
return 0;
}