Shortest Prefixes

最新推荐文章于 2024-03-22 11:38:13 发布

CODE_BALL

最新推荐文章于 2024-03-22 11:38:13 发布

阅读量488

点赞数

分类专栏：数&&图

本文链接：https://blog.csdn.net/codeball/article/details/38324565

版权

数&&图专栏收录该内容

33 篇文章 0 订阅

订阅专栏

Shortest Prefixes

Time Limit:1000MS Memory Limit:30000KB 64bit IO Format:%I64d & %I64u

Submit Status

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

这道题目挺好玩！！！

输入一些字符串，以文件结束为结束，求在这些字符串中，每一串相对于其他字符串的最大前缀。

思路：

每输入一串字符串，就用字典树整理出来，每个字母出现一次，相应的次数就加1，最后对于每一个字符串进行字典树查询，查到的第一个字母出现次数为1的字母和之前的字母就是这个字符串的最大前缀。


#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <iostream>
#include <algorithm>

using namespace std;

struct node
{
    int flag;
    struct node *next[27];
}*head,*p;
char sz[1009][30];

node *newnode()
{
    int i;
    struct node *q;
    q = (struct node *) malloc (sizeof(struct node));
    q->flag = 0;
    for(i = 1; i <= 26; i++)
    {
        q->next[i] = NULL;
    }
    return q;
}

int jianshu(int i,node *p)
{
    int l,j,k;
    l = strlen(sz[i]);
    for(k = 0; k < l; k++)
    {
        j = sz[i][k] - 'a' + 1;
        if(p->next[j] == NULL)
        {
            p->next[j] = newnode();
             p = p->next[j];
             p->flag++;
        }
        else
        {
             p = p->next[j];
             p->flag++;
        }
    }
}

void cha(int j,node *p)
{
    int l,m,k;

    l = strlen(sz[j]);
    printf("%s ",sz[j]);
    for(m = 0; m < l; m++)
    {
        k = sz[j][m] - 'a' + 1;
        p = p->next[k];
        if(p->flag != 1)
            printf("%c",sz[j][m]);
        else if(p->flag == 1)
        {
            printf("%c",sz[j][m]);
            break;
        }
    }
    printf("\n");
}

int main()
{
    head = newnode();
    int i = 1,j,k;
    while(scanf("%s",sz[i]) != EOF)
    {
        jianshu(i,head);
        i++;
    }
    for(j = 1; j < i; j++)
    {
        cha(j,head);
    }
    return 0;
}