POJ2001+字典树

简单的字典树

/*
字典树
*/
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<algorithm>
#include<iostream>
#include<queue>
#include<map>
#include<vector>
#include<math.h>
using namespace std;
typedef long long ll;
//typedef __int64 int64;
const int maxn = 26;
const int inf = 0x7FFFFFFF;
const int CLEAR = 0x7F;
const double pi=acos(-1.0);
const double eps = 1e-8;
struct tree{
    int lev;
    tree* next[ maxn ];
};
tree root;
char ch[ 1005 ][ maxn ];

void build( char str[] ){
    tree *p = &root;
    tree *tmp;
    int len = strlen( str );
    for( int i=0;i<len;i++ ){
        int id = str[ i ]-'a';
        if( p->next[ id ]==NULL ){
            tmp = ( tree * )malloc( sizeof(root) );
            tmp->lev = 1;
            for( int j=0;j<maxn;j++ ){
                tmp->next[j]=NULL;
            }
            p->next[ id ] = tmp;
            p = p->next[ id ];
        }
        else{
            p->next[ id ]->lev++;
            p = p->next[ id ];
        }
    }
}//建树
int find( char str[] ){
    int len = strlen( str );
    tree *p = &root;
    for( int i=0;i<len;i++ ){
        int id = str[ i ]-'a';
        if( p->next[id]==NULL ){
            return -1;
        }
        p = p->next[id];
        if( p->lev==1 ) return i;
    }
    return len-1;
}//查找

int main(){
    int cnt = 0;
    while( scanf("%s",ch[ cnt ])!=EOF ){
        build( ch[ cnt ] );
        cnt++;
    }
    for( int i=0;i<cnt;i++ ){
        int pos;
        pos = find( ch[i] );
        printf("%s ",ch[ i ]);
        for( int j=0;j<=pos;j++ ){
            printf("%c",ch[ i ][ j ]);
        }
        printf("\n");
    }
    delete (&root);
    return 0;
}