trie树 寻找以当前输入的字符串为前缀的字典里有多少个

 

 

题：

http://acm.hrbeu.edu.cn/index.php?act=problem&id=1007&cid=27

 

 

题意很简单，也很快想到了用tire树，但是有人说他不用也能A，应该是数据比较弱，当然我是为了训练的，所以找了个水题测试了自己编写的。要当模板使用。

 

 

 

#include<memory.h> #include<string> #include<string.h> #include<stdio.h> #include<iostream> using namespace std ; const int TM = 27 ; const int TTM = 100000 ; struct trienode { bool isword; int next[TM] ; // next[0] rem the number, the word from index 1 -> 26 } trietree[TTM]; // maybe is small,then u should change it or rewrite the trietree const int WM =100 ; int que[WM] ; int fq,rq ; class TRIE { private: int head ; int now ; public: TRIE() { head = 1 ; // the root now = 1 ; // the first node memset(trietree,0,sizeof(trietree)); } ~TRIE() {} inline int loc(char ch) { return ch-'a' +1; // or ch-'A'+1 , from index 1 } void insert( char ch[] ) { int i; int p=head; //bool flag=false; //fq = 0 ; //rq = -1 ; for( i=0 ; i < strlen(ch) ; i ++ ) { //que[++rq] = p ; //cout<<"I:"<<trietree[p].next[loc(ch[i])]<<endl; if( ! trietree[p].next[loc(ch[i])] ) { trietree[p].next[0] ++ ; //cout<<"I_if:"<<trietree[p].next[0]<<endl; trietree[p].next[loc(ch[i])] = (p=++now) ; } else { //flag = true; trietree[p].next[0] ++ ; //cout<<"I_else:"<<trietree[p].next[0]<<endl; p=trietree[p].next[loc(ch[i])]; } } trietree[p].isword = true; trietree[p].next[0] ++ ; /* if(!flag) { while( fq <= rq ) { trietree[ que[fq++] ].next[0] -- ; } } */ } bool search(char ch[]) // all is the same ,if u want to find the substring,u should change the function "search" { int i,p=head; for(i=0; i<strlen(ch)&&p!=0 ; i++ ) { //cout<<"s: "<<trietree[p].next[loc(ch[i])]<<endl; if( ! (p=trietree[p].next[loc(ch[i])] ) ) return false; } if(i==strlen(ch)&&p!=0 && trietree[p].isword ) // here hint { //word = trietree[p].word ; return true; } return false; } int isprefix(char ch[]) { int i,p=head; for(i=0; i<strlen(ch)&&p!=0 ; i++ ) { //cout<<"prefix: "<<ch[i]<<" "<<trietree[p].next[0]<<endl; if( ! (p=trietree[p].next[loc(ch[i])] ) ) return 0; } if(i==strlen(ch) ) // here hint return trietree[p].next[0]; return 0; } } ; /* absolute acm banana band bee ba b band abc */ int main() { //freopen("1007.txt","r",stdin); int n,m; bool jud = false ; char chin[100]; TRIE trie; while( gets(chin) ) { if(!jud) { if(strlen(chin) == 0 ) { jud = true ; continue; } trie.insert(chin); } else { printf("%d/n",trie.isprefix(chin)); } } return 0; } 

 

 

 

这里，我使用next[0] 记录以当前节点为根的树的叶子的个数，也就说，以从头到当前节点的字符串为前缀的数目，由于说输入没有重复的，所以，就不需要做 后悔操作