poj 2001 Shortest Prefixes（特里）

主题链接：http://poj.org/problem?id=2001

Description

A prefix of a string is a substring starting at the beginning of the given string. The prefixes of "carbon" are: "c", "ca", "car", "carb", "carbo", and "carbon". Note that the empty string is not considered a prefix in this problem, but every non-empty string is considered to be a prefix of itself. In everyday language, we tend to abbreviate words by prefixes. For example, "carbohydrate" is commonly abbreviated by "carb". In this problem, given a set of words, you will find for each word the shortest prefix that uniquely identifies the word it represents. 

In the sample input below, "carbohydrate" can be abbreviated to "carboh", but it cannot be abbreviated to "carbo" (or anything shorter) because there are other words in the list that begin with "carbo". 

An exact match will override a prefix match. For example, the prefix "car" matches the given word "car" exactly. Therefore, it is understood without ambiguity that "car" is an abbreviation for "car" , not for "carriage" or any of the other words in the list that begins with "car". 

Input

The input contains at least two, but no more than 1000 lines. Each line contains one word consisting of 1 to 20 lower case letters.

Output

The output contains the same number of lines as the input. Each line of the output contains the word from the corresponding line of the input, followed by one blank space, and the shortest prefix that uniquely (without ambiguity) identifies this word.

Sample Input

carbohydrate
cart
carburetor
caramel
caribou
carbonic
cartilage
carbon
carriage
carton
car
carbonate

Sample Output

carbohydrate carboh
cart cart
carburetor carbu
caramel cara
caribou cari
carbonic carboni
cartilage carti
carbon carbon
carriage carr
carton carto
car car
carbonate carbona

Source

Rocky Mountain 2004

题意：

寻找在单词表中能唯一作为此单词的缩写！

代码例如以下：

#include <cstdio>
#include <cstring>
#include <malloc.h>
#include <iostream>
using namespace std;
#define MAXN 26
char str[1017][MAXN];
typedef struct Trie
{
    int v;//依据须要变化
    Trie *next[MAXN];
    //next是表示每层有多少种类的数。假设仅仅是小写字母。则26就可以，
    //若改为大写和小写字母，则是52，若再加上数字，则是62了
} Trie;
Trie* root;

void createTrie(char *str)
{
    int len = strlen(str);
    Trie *p = root, *q;
    for(int i = 0; i < len; i++)
    {
        int id = str[i]-'a';
        if(p->next[id] == NULL)
        {
            q = (Trie *)malloc(sizeof(Trie));
            q->v = 1;//初始v==1
            for(int j = 0; j < MAXN; j++)
                q->next[j] = NULL;
            p->next[id] = q;
            p = p->next[id];
        }
        else
        {
            p->next[id]->v++;
            p = p->next[id];
        }
    }
    // p->v = -1;//若为结尾。则将v改成-1表示
}

void findTrie(char *str)
{
    char ss[MAXN];
    int len = strlen(str);
    Trie *p = root;
    for(int i = 0; i < len; i++)
    {
        int id = str[i]-'a';
        p = p->next[id];
        ss[i] = str[i];
        ss[i+1] = '';
        if(p->v == 1) //能够唯一标示该字符串的前缀
        {
            printf("%s %s
",str,ss);
            return ;
        }
        //   return 0;
        //  if(p->v == -1)   //字符集中已有串是此串的前缀
        //      return -1;
    }
    //return p->v;
    // return -1;   //此串是字符集中某串的前缀
    printf("%s %s
",str,str);
    // return;
}
int main()
{
    int cont = 0;
    root = (Trie *)malloc(sizeof(Trie));
    for(int i = 0; i < MAXN; i++)
        root->next[i] = NULL;
    while(scanf("%s",str[cont])!=EOF)
    {
        createTrie(str[cont]);
        cont++;
    }
    for(int i = 0; i < cont; i++)
    {
        findTrie(str[i]);
    }
    return 0;
}

版权声明：本文博主原创文章，博客，未经同意，不得转载。