STL语法——集合：set 安迪的第一个字典（Andy&a…

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.

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.

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.

 1 #include<iostream>  
 2 #include<string>  
 3 #include<set>  
 4 #include<sstream>  
 5 using namespace std;  
 6   
 7 set<string> dict;//set up a set called dict-short for dictionary,and it's based on string type;  
 8   
 9 int main(){  
10     string s,buf;  
11     while (cin>>s){  
12         for (int i=0;i<s.length();i++)  
13           if (isalpha(s[i])) s[i]=tolower(s[i]);//if it's an letter,turn it lowercase.Others turn space and use stringstream to leave it out=ignore it  
14           else s[i]=' ';  
15         stringstream ss(s);  
16         while (ss>>buf) dict.insert(buf);//insert it into the set which is already in order,TYkon said it's a balanced tree inside  
17     }  
18     for (set<string>::iterator it=dict.begin();it!=dict.end();++it)//iterator just like a point,scan it from beginning to end and output  
19       cout<<*it<<endl;//NOTICE output by point  
20     return 0;  
21 }

1 for (set<string>::iterator it=dict.begin();it!=dict.end();++it)//iterator just like a point,scan it from beginning to end and output  
2       cout<<*it<<endl;//NOTICE output by point