当前位置：首页 -> 基础 -> c++编程基础

HDU 1075(What Are You Talking About-Trie的插入和查找)(二)

2014-11-24 07:24:59 · 作者: · 浏览: 1
标签: HDU 1075 What Are You Talking About-Trie 插入 查找
t i=0;i
{
if (islower(s[i]))
{
int j=i;
while (islower(s[j+1])) j++;
node *p=find(i,j);
if (p) printf("%s",p->t);
else
{
for (int k=i;k<=j;k++) printf("%c",s[k]);
}
i=j;
}
else printf("%c",s[i]);
}
printf("\n");
}
return 0;
}