POJ-2001（trie字典树）

最新推荐文章于 2020-07-31 10:04:18 发布

famousDT

最新推荐文章于 2020-07-31 10:04:18 发布

阅读量334

点赞数

分类专栏：数据结构文章标签： search tree struct null c

本文链接：https://blog.csdn.net/famousDT/article/details/7313264

版权

数据结构专栏收录该内容

31 篇文章 0 订阅

订阅专栏

char ss[1005][30];
struct trie
{
	int cnt;
	trie *p[26];
} * root;
void make_tree(char *s)
{
	trie * r = root;
	trie * tmp;
	int i, j;
	for (i = 0; s[i] != '\0'; ++i) {
		if (r->p[s[i] - 'a'] == NULL) {
			tmp = new trie;
			tmp->cnt = 0;
			for (j = 0; j < 26; ++j)
				tmp->p[j] = NULL;
			r->p[s[i] - 'a'] = tmp;
		}
		r = r->p[s[i] - 'a'];
		r->cnt++;
	}
}
void search(char s[])
{
	trie * r = root;
	int i;
	for (i = 0; s[i] != '\0'; ++i) {
		r = r->p[s[i] - 'a'];
		printf("%c", s[i]);
		if (r->cnt == 1)
			break;
	}
	printf("\n");
}
int main()
{
	root = new trie;
	int i, j;
	for (i = 0; i < 26; ++i)
		root->p[i] = NULL;
	i = 0;
	while (scanf("%s", ss[i]) == 1) {
		make_tree(ss[i]);		
		++i;
	}
	for (j = 0; j < i; ++j) {
		printf("%s ", ss[j]);
		search(ss[j]);
	}
	return 0;
}