UVAOJ 10815 Andy‘s First Dictionary(stringstream的用法)

最新推荐文章于 2024-02-21 15:20:05 发布

原创最新推荐文章于 2024-02-21 15:20:05 发布 · 185 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#stl #c++

SDNUOJ 专栏收录该内容

74 篇文章

订阅专栏

8岁的Andy梦想制作自己的词典。他计划从喜爱的故事书中摘录不同的单词并按字母顺序排列。此任务需处理大量文本数据，提取不同单词，并考虑大小写不敏感等因素。

Andy, 8, has a dream - he wants to produce his
very own dictionary. This is not an easy task for
him, as the number of words that he knows is,
well, not quite enough. Instead of thinking up all
the words himself, he has a briliant idea. From
his bookshelf he would pick one of his favourite
story books, from which he would copy out all
the distinct words. By arranging the words in
alphabetical order, he is done! Of course, it is
a really time-consuming job, and this is where a
computer program is helpful.
You are asked to write a program that lists
all the different words in the input text. In this
problem, a word is defined as a consecutive sequence of alphabets, in upper and/or lower case.
Words with only one letter are also to be considered. Furthermore, your program must be CaSe InSeNsItIvE. For example, words like “Apple”, “apple” or “APPLE” must be considered the same.

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.

Sample Input
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.

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

stringstream的头文件是sstream，支持<<和>>运算符，
<<是将别的内容以字符串的形式放到stringstream定义的对象中，>>是将对象中的内容放到别的合适类型的变量中，以空格作为分隔符，每次放一个进去，如果想全部依次取出，可以用while实现。

下面是代码：

#include<iostream>
#include<string>
#include<cstring>
#include<algorithm>
#include<cstdlib>
#include<set>
#include<sstream>
using namespace std;
set<string> st;
set<string>::iterator p;
int main()
{
	stringstream sss;
	string s,ss;
	while(cin>>s)
	{
		for(int i=0;i<s.size();++i)
		{
			if(s[i]>='A'&&s[i]<='Z') s[i]+=32;
			else if(s[i]>='a'&&s[i]<='z') continue;
			//else s.erase(i--,1);
			else s[i]=' ';
		}
		sss.clear();
		sss<<s;
		while(sss>>ss)//把sss中的东西以空格为分隔符依次读入到ss中
		{
			st.insert(ss);
		}
//		if(!s.empty())
//		st.insert(s);
	}
	for(p=st.begin();p!=st.end();++p)
	{
		cout<<*p<<endl;
	}
	return 0;
}