UVa 1401 Remember the Word (Trie树模板题)
http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=505&page=show_problem&problem=4147
递推写法:
L = strlen(text);
for (i = L - 1; i >= 0; --i)
{
trie.find_prefixes(text +
原创
2014-03-02 09:31:51 ·
1083 阅读 ·
0 评论