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
hey
to
two
went
were
when
题的大致意思是输入一串字符串,找出共有多少个不同的单词,并按字典序输出他们。
用一个动态字符串数组,每次读取一个字符,直到这些字符组成单个单词,即读到’\0’。再把这个字符复制给数组,最后排序。题目难度之处在于对stl的容器和函数了解甚少,如果多了解一些,此题并不是很难。
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<vector>
using namespace std;
int main()
{
char c,s[10000];
int i=0;
vector<string>a;
while(~(c=getchar()))
{
if(isalpha(c))//判断字符c是否为英文字母
{
s[i]=tolower(c);//把字母字符转换为小写,非字符字母不做处理
i++;
}
else if(i!=0)
{
s[i]='\0';
a.push_back(s);//向表尾插入元素s
i=0;
}
}
sort(a.begin(),a.end());
cout<<a[0]<<endl;
for(i=1;i<a.size();i++)//a.size()表示表长
{
if(a[i]!=a[i-1])
cout<<a[i]<<endl;
}
return 0;
}