Problem Description
Ignatius最近遇到一个难题,老师交给他很多单词(只有小写字母组成,不会有重复的单词出现),现在老师要他统计出以某个字符串为前缀的单词数量(单词本身也是自己的前缀).
Input
输入数据的第一部分是一张单词表,每行一个单词,单词的长度不超过10,它们代表的是老师交给Ignatius统计的单词,一个空行代表单词表的结束.第二部分是一连串的提问,每行一个提问,每个提问都是一个字符串.
注意:本题只有一组测试数据,处理到文件结束.
注意:本题只有一组测试数据,处理到文件结束.
Output
对于每个提问,给出以该字符串为前缀的单词的数量.
Sample Input
banana band bee absolute acm ba b band abc
Sample Output
2 3 1 0
字典树解法:
#include <stdio.h>
#include <stdlib.h>#include <string.h>
struct Dictree
{
struct Dictree *chd[26];
int n;
};
struct Dictree *root;
void insert(char *str)
{
int i, len;
struct Dictree *current;
len = strlen(str);
current = root;
for (i = 0; i < len; ++i)
{
if (current->chd[str[i] - 'a'] != NULL)
{
current = current->chd[str[i] - 'a'];
current->n += 1;
}
else
{
struct Dictree *newNode;
int j;
newNode = (struct Dictree *)malloc(sizeof(*newNode));
for (j = 0; j < 26; ++j)
{
newNode->chd[j] = NULL;
}
newNode->n = 1;
current->chd[str[i] - 'a'] = newNode;
current = newNode;
}
}
}
int find(char *str)
{
struct Dictree *current = root;
int i, len;
len = strlen(str);
for (i = 0; i < len; ++i)
{
if (current->chd[str[i] - 'a'] == NULL)
{
return 0;
}
else
{
current = current->chd[str[i] - 'a'];
}
}
return current->n;
}
int main()
{
char tmp[11];
int i, num;
root = (struct Dictree *)malloc(sizeof(*root));
for (i = 0; i < 26; ++i)
{
root->chd[i] = NULL;
}
while (gets(tmp), strcmp(tmp, "") != 0)
{
insert(tmp);
}
while (gets(tmp) != NULL)
{
num = find(tmp);
printf("%d\n", num);
}
return 0;
}