算法入门经典(第2版)集合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--每个元素最多只出现一次。自定义类型也可以构造set,但同样也必须定义“小于”运算符。直接使用set保存单词集合,输入时把所有的非字母的字符变成了空格,然后利用stringstream得到各个单词。tolower()函数:将大写转化为小写。isalpha():判断函数,判断字符是否为英文字母,若是,返回非零(小写返回2,大写返回1),若不是,返回0。
#include<iostream>
#include<set>
#include<string>
#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;
}