hdu 1247 Hat’s Words Trie树

最新推荐文章于 2021-02-23 14:50:36 发布

Shicheng_Yang

最新推荐文章于 2021-02-23 14:50:36 发布

阅读量982

点赞数

分类专栏：字符串

本文链接：https://blog.csdn.net/jyysc2010/article/details/9815991

版权

字符串专栏收录该内容

31 篇文章 0 订阅

订阅专栏

Hat’s Words

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 5729 Accepted Submission(s): 2135

Problem Description

A hat’s word is a word in the dictionary that is the concatenation of exactly two other words in the dictionary.
You are to find all the hat’s words in a dictionary.

Input

Standard input consists of a number of lowercase words, one per line, in alphabetical order. There will be no more than 50,000 words.
Only one case.

Output

Your output should contain all the hat’s words, one per line, in alphabetical order.

Sample Input

      
      
       
       a
ahat
hat
hatword
hziee
word

Sample Output

      
      
       
       ahat
hatword

Author

戴帽子的

Recommend

Ignatius.L

题意：把单词分成两个，然后判断是不是为出现的单词，直接把单词建树，然后把单词分成两个部分找到即可。

#include <iostream>
#include <cstdlib>
#include <cstring>
#include <cstdio>
using namespace std;

const int N=26;
char str[50005][20];
typedef struct Trie
{
    int v;//根据需要变化
    Trie *next[26];
} 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<26; ++j)
                q->next[j] = NULL;
            p->next[id] = q;
        }
            p = p->next[id];
    }
    // p->v = -1;   //若为结尾，则将v改成-1表示(视情况而定)
    p->v = -1;
}

int findTrie(char *str)
{
    int len = strlen(str);
    Trie *p = root;
    for(int i=0; i<len; ++i)
    {
        //根据需要选择是减去'0'还是'a'，或者是'A'
        int id = str[i]-'a';
        p = p->next[id];
        //若为空集，表示不存以此为前缀的串
        if(p == NULL)
            return 0;
    }
        //字符集中已有串是此串的前缀
        if(p->v == -1)
            return -1;
     //此串是字符集中某串的前缀
    return 0;
}
int deal(Trie* T)
{
    //这是把T清空，一开始没加这个，结果MLE
    int i;
    if(T==NULL)
        return 0;
    for(i=0; i<N; i++)
    {
        if(T->next[i]!=NULL)
            deal(T->next[i]);
    }
    free(T);
    return 0;
}

char a[105],b[105];

int main()
{
    int i,j,n;
    root = (Trie *) malloc (sizeof(Trie));
    for(int i=0; i<N; i++)
        root->next[i]=NULL;
    n=0;
    while(scanf("%s",str[n])!=EOF)
    {
        createTrie(str[n]);
        n++;
    }
    for(i=0; i<n; i++)
    {
        int len=strlen(str[i]);
        for(j=0; j<len; j++)
        {
            memset(a,'\0',sizeof(a));
            memset(b,'\0',sizeof(b));
            strncpy(a,str[i],j);
            strncpy(b,str[i]+j,len-j);
            if(findTrie(a)==-1&&findTrie(b)==-1)
            {
                printf("%s\n",str[i]);
                break;
            }
        }
    }
    deal(root);
    return 0;
}