摘要：
链表版字典树 class Trie { Trie* next[26]; int num; public: Trie() { for (int i = 0; i < 26; ++i) next[i] = NULL; num = 0; } void insert(char *s) { Trie *p = 阅读全文
摘要：
hdu1251统计难题 链表版字典树： #include <cstdio> #include <string> using namespace std; class Trie { Trie* next[26]; int num; public: Trie() { for (int i = 0; i 阅读全文