典型的Trie樹， 算是復習一下字符串吧， 就是輸入有點惡心，代碼如下：

#include <cstdio> #include <cstring> #include <algorithm>using namespace std; const int maxn = 500000+100; struct Trie{bool isword;int next[26];char words[15];Trie(){memset(next, -1, sizeof(next));isword = false;} }Root; Trie node[maxn]; int n;void Insert(char *tar){Trie *head = &Root;char *s = tar;while(*tar!=' ') tar++;*tar='\0';tar++;while(*tar!='\0'){int id = *tar - 'a';if(head->next[id] == -1){head->next[id] = n++;}head = &node[head->next[id]];tar++;}head->isword = true;//printf("s = %s\n", s);strcpy(head->words, s); }char *Search(char *tar) {Trie *head = &Root;while(*tar){int id = *tar - 'a';if(head->next[id] == -1) return NULL;head = &node[head->next[id]];tar++;}if(head->isword) return head->words;else return NULL; }char str[100];int main(){n = 0;while(gets(str)){bool kongge = false;int len = strlen(str);for(int i=0; i<len; i++) {if(str[i] == ' '){kongge = true;break;}}if(str[0]<'a'||str[0]>'z') continue;if(kongge) Insert(str);else {char *p = Search(str);if(p == NULL) printf("eh\n");else printf("%s\n", p);}}return 0; }

?

轉載于:https://www.cnblogs.com/xingxing1024/p/5285468.html

總結

以上是生活随笔為你收集整理的poj 2503 Trie树的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。