UVA_10815: Andy's First Dictionary

最新推荐文章于 2021-01-26 17:52:20 发布

原创最新推荐文章于 2021-01-26 17:52:20 发布 · 457 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#c++ #uva

算法专栏收录该内容

141 篇文章

订阅专栏

本文介绍了一种使用C++编程语言解析文本文件的方法，通过STL库中的set和string来查找并输出文本中不同的单词，并确保所有单词以小写形式并按字母顺序排列呈现。

Input
The input file is a text with no more than 5000 lines. An input line has at most 200 characters. Input is terminated by EOF.

Output
Your output should give a list of different words that appears in the input text, one in a line. The words should all be in lower case, sorted in alphabetical order. You can be sure that he number of distinct words in the text does not exceed 5000.

SampleInput

Adventures in Disneyland
Two blondes were going to Disneyland when they came to a fork in the
road. The sign read: "Disneyland Left."
So they went home.

SampleOutput

a
adventures
blondes
came
disneyland
fork
going
home
in
left
read
road
sign
so
the
they
to
two
went
were

when

分析：本题主要考察STL的应用，利用set和string可以很快的完成

#include <iostream>
#include <string>
#include <set>
#include <sstream>

using namespace std;

set<string> dict;

int main()
{
	string s, buf;
	while(cin >> s)
	{
		for(int i=0; i<s.length(); i++)
			if(isalpha(s[i]))s[i]=tolower(s[i]);
			else s[i]=' ';
		stringstream ss(s);
		while(ss >> buf) dict.insert(buf);
	}

	for(set<string>::iterator it = dict.begin(); it!=dict.end(); it++)
		cout << *it << "\n";
    return 0;
}