集合与映射也是两个常用的容器。set就是数学上的集合---每个元素最多只出现一次。和sort一样,自定义类型也可以构造set,但同样必须定义“小于”运算符。
题目:
输入一个文本,找出所有不同的单词(连续的字母排序),按字典序从小到大输出。单词不区分大小写。
样例输入:
【样例输入】
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.
【样例输出】
a
adventures
blondes
came
disneyland
fork
going
home
in
left
read
road
sign
so
the
they
to
two
went
were
when
分析:
本题没有太多的技巧,只是为了展示set的用法:由于string已经定义了“小于”运算符,直接使用set保存单词集合即可。
#include<iostream>
#include<string>
#include<set>
#include<sstream>
using namespace std;
set<string> dict; //string 集合
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;
}