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
题目大意: 根据输入的文本燕妮找出有多少个不同的单词(不区分大小写,即,只要单词相同不管怎么写的都算一个单词),并且按照字典序输出他们
解题思路:用一个不定长字符串数组,每次读取单个字符,直到这单个字符组成一个单词(即读取到 '\0' ),再把这个字符赋值给不定长数组,最后在排序,再找到不同的,最后输出,注意在赋值时要注意的就是 读取的是空格就跳过
源代码:
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
using namespace std;
int main()
{
char c,s[5002];
int i=0;
vector<string> a;
while (~(c=getchar()))
{
if (isalpha(c))
{
s[i]=tolower(c);
i++;
}
else if (i!=0)//判断什么时候他是字符
{
s[i]='\0';
a.push_back(s);
i=0;
}
}
sort(a.begin(),a.end());
cout<<a[0]<<endl;
for (i=1;i<a.size();i++)
{
if (a[i]!=a[i-1])
cout<<a[i]<<endl;
}
return 0;
}