-
Notifications
You must be signed in to change notification settings - Fork 0
/
code1014.c
66 lines (61 loc) · 1.41 KB
/
code1014.c
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
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <stdint.h>
typedef struct TrieNode{
struct TrieNode *childNode;
char nodeChar;
int count;
uint8_t word_flag;
}trie_node_t;
void init_node(trie_node_t *node,char nodeChar,uint8_t word_flag)
{
node->childNode = (trie_node_t*)malloc(sizeof(trie_node_t) * 26);
memset(node->childNode,0,sizeof(trie_node_t) * 26);
node->nodeChar = nodeChar;
node->count = 0;
node->word_flag = word_flag;
}
void add_trie_node(trie_node_t *root,const char *word,size_t len)
{
if(len == 0)
return;
int k = word[0] - 'a';
if(root->childNode[k].nodeChar == 0){
init_node(&(root->childNode[k]),word[0],len == 1?1:0);
}
root->childNode[k].count += 1;
add_trie_node(&(root->childNode[k]),++word,--len);
}
int search_tree(trie_node_t *root,const char *word,size_t len)
{
if(len == 0)
return 0;
int k = word[0] - 'a';
if(root->childNode[k].nodeChar == word[0]) {
if(len == 1) {
return root->childNode[k].count;
}
else {
return search_tree(&(root->childNode[k]),++word,--len);
}
}
return 0;
}
int main(int argc,char *argv[])
{
int times;
char buf[11] = {0};
trie_node_t root;
init_node(&root,0,0);
for(scanf("%d",×);times != 0;times--) {
scanf("%s",buf);
add_trie_node(&root,buf,strlen(buf));
}
for(scanf("%d",×);times != 0;times--) {
scanf("%s",buf);
int num = search_tree(&root,buf,strlen(buf));
printf("%d\n",num);
}
return 0;
}