uva 10391 compound words

最新推荐文章于 2020-03-10 16:22:37 发布

转载最新推荐文章于 2020-03-10 16:22:37 发布 · 297 阅读

文章标签：

#set #string #STL #uva

STL 专栏收录该内容

11 篇文章

订阅专栏

本文介绍了一种算法，用于从字典中找出所有由两个单词组成的复合词。输入为按字母顺序排列的单词列表，输出为按字母顺序排列的复合词列表。示例展示了如何通过拆分字符串并检查子串来确定复合词。

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

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

Output
Your output should contain all the compound words, one per line, in alphabetical order.

Sample Input
a
alien
born
less
lien
never
nevertheless
new
newborn
the
zebra

Sample Output
alien

newborn

题解：看是否有一个单词是由其他两个单词构成的。用string.substr(a,b)//始a,终b 来拆分string,再来寻找。

#include <iostream>
#include <set>
#include <cstdio>
#include <string>
using namespace std;

set <string> v;//set容器

int main()
{
    string st;
    set <string>::iterator p;//迭代器
    while(cin>>st)
        v.insert(st);
    for(p=v.begin(); p!=v.end(); p++)
    {
        st=*p;
        for(int i=0; i<st.length()-1; i++)
        {
            string sub1=st.substr(0,i+1);//拆分string,再去寻找
            string sub2=st.substr(i+1,st.length()-(i+1));
            if( v.find(sub1)!=v.end() && v.find(sub2 )!=v.end() )//查找
            {
                printf("%s\n",st.c_str());//将string用%s输出
                break;
            }
        }
    }
    return 0;
}

uva ：原题链接

国内链接：https://vjudge.net/contest/169852#problem/E