字典树用于单词统计，查询，非常有用。现在就Trie树给出C语言实现。
题目来源：http://hihocoder.com/problemset/problem/1014
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
|
#include <malloc.h>
#define MAXN 26
struct {
int count;
int flag;
struct *next[MAXN];
};
struct *rt;
void trie_init(){
int i;
rt = (struct Trie*)malloc(sizeof(struct Trie));
rt->count = 0;
rt->flag = 0;
for(i=0; i<MAXN; ++i)
rt->next[i] = NULL;
}
void trie_insert(char *s){
int i;
struct *tmp = rt;
for(s; *s!='
|
近期评论