字典树裸题 Shortest Prefixes

#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<algorithm>
using namespace std;
struct Tire
{
	int num;
	Tire *next[26];
};
Tire *root;

void init() //初始化
{
	root = new Tire;
	for(int i=0;i<26;++i)
	{
		root->next[i]=NULL;
	}
}
void insert(char *word) 
{
	int temp, len;
	Tire *cur;
	len = strlen(word);
	cur = root;
	for(int i=0;i<len;++i)
	{
		temp =word[i]-'a';	
		if(cur->next[temp]==NULL)
		{
			Tire *newTire=new Tire;
			newTire->num=1;
			for(int j=0;j<26;++j)
			{
				newTire->next[j]=NULL;
			}
			cur->next[temp]=newTire;
			cur=newTire;
		}
		else
		{
			cur=cur->next[temp];
			cur->num++;
		}
	}
}
void del(Tire *root)
{
	for(int i=0;i<26;++i)
	{
		if(root->next[i]!=NULL)
			del(root->next[i]);
	}
	delete(root);
}
void search(char *word)
{
	int len,temp;
	Tire *cur;
	char ans[25];
	len=strlen(word);
	cur=root;
	for(int i=0;i<len;++i)
	{
		temp=word[i]-'a';
		cur=cur->next[temp];
		ans[i]=word[i];
		ans[i+1]='\0';
		if(cur->num==1)
		{
			printf("%s %s\n",word,ans);
			return ;
		}
	}
	printf("%s %s\n",word,word);
}	
char str[1005][25];
int main()
{
	int i,t=0;
	init();
	while(scanf("%s",str[t])!=EOF)
	{
		insert(str[t]);
		t++;
	}
	for(i=0;i<t;i++)
		search(str[i]);
	//del(root);
	return 0;
}