POJ 2001 Trie树

题意：输入一系列单词，找到每一个单词特有的前缀，且使前缀尽量的短。

#include <iostream>
using namespace std;

const int kind = 26;
int k = 0;

struct Tree
{
	int count;
	Tree *next[kind];
	Tree()
	{
		count = 1;/*记录某个字母被使用的次数，若只被使用过一次，即说明该字母是某个单词所特有的，
以该字母结尾的前缀是最短前缀*/
		for ( int i = 0; i < kind; ++i )
			next[i] = NULL;
	}
} node[100000], root;

void Insert ( char* word )
{
	Tree *location = &root;
	int i = 0, id;
	while ( word[i] )
	{
		id = word[i] - 'a';
		if ( location->next[id] == NULL )
			location->next[id] = &node[k++];
		else location->next[id]->count ++;
		location = location->next[id];
		++i;
	}
}

int Search ( char *word ) 
{
	Tree *location = &root;
	int i = 0, id;
	while ( word[i] )
	{
		id = word[i] - 'a';
		if ( location->next[id] == NULL || location->next[id]->count == 1 )
			return i;
		location = location->next[id];
		++i;
	}
	return i-1;
}

int main()
{
	char list[1001][21];
	int i = 0, j, pos;
	while ( gets(list[i]) )
	{
		Insert(list[i]);
		++i;
	}
	for ( j = 0; j < i; ++j )
	{
		printf("%s ",list[j]);
		pos = Search(list[j]);
		list[j][pos+1] = '\0';
		printf("%s\n",list[j]);
	}
	return 0;
}