题目链接:http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=1109
题目大意:给定若干对字符串,每个串对应另一个字符串。现在给出若干个字符串,输出它对应的字符串。
解题思路:用字典树求解,先建树,字典树节点保存的信息:是否是出现过的字符串末尾,是的话记录它对应的字符串。再对每个串进行查询。
测试数据:
dog ogday
cat atcaypig igpay
froot ootfray
loops oopslay
atcay
ittenkay
oopslay
代码:
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define MAX 110000
struct node {
char str[11];
node *next[26];
}*root;
char dir[26],fat[26],tar[26];
node *CreateNode() {
node *p;
p = (node *) malloc (sizeof(node));
p->str[0] = '\0';
for (int i = 0; i < 26; ++i)
p->next[i] = NULL;
return p;
}
void Insert(char *fat,char *dir) {
int i = 0,k;
node *p = root;
while (fat[i]) {
k = fat[i++] - 'a';
if (p->next[k] == NULL)
p->next[k] = CreateNode();
p = p->next[k];
}
strcpy(p->str,dir);
}
char *Query(char *str) {
int i = 0,k;
node *p = root;
while (str[i]) {
k = str[i++] - 'a';
if (p->next[k]==NULL)
break;
p = p->next[k];
}
return p->str;
}
int main()
{
int i,j,k;
char c;
root = CreateNode();
while (c = getchar(),c != '\n') {
i = 0;
dir[i++] = c;
while (c = getchar(),c != ' ')
dir[i++] = c;
dir[i] = '\0';
i = 0;
while (c = getchar(),c != '\n')
fat[i++] = c;
fat[i] = '\0';
Insert(fat,dir);
}
while (scanf("%s",tar) != EOF) {
char *ans = Query(tar);
if (ans[0] == '\0')
printf("eh\n");
else printf("%s\n",ans);
}
}
本文ZeroClock原创,但可以转载,因为我们是兄弟。