題干：

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 DisneylandTwo 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

題目大意：

? ?輸入一個文本，找出所有不同的單詞（連續的字母序列），按字典序升序輸出。單詞不區分大小寫。

解題報告：

? ? ?使用STL的set自動去重+排序的優勢，并且這里使用了流處理sstream，將讀入的文章整合成只含有小寫字母和空格的字符串。黑科技啊！注意啊這題如果用map映射字符串的話，首先你要形成字符串所以需要在每個字符串后加 ?' \0 ' ！

AC代碼：(20ms)

#include<iostream> #include<string> #include<set> #include<sstream> using namespace std;set<string> st; set<string>::iterator it; int main() {std::ios::sync_with_stdio(false);string s,buf;while(cin>>s) {for(int i=0;i<s.length();i++){if(isalpha(s[i]))s[i]=tolower(s[i]);elses[i]=' '; //將輸入的非字符轉換為空格，作為單詞的分界點。 } stringstream ss(s);//導入流ss中 注意格式while(ss>>buf)st.insert(buf);//從流里導出標準的string類（因為前面已經整合好了）}for(it=st.begin();it!=st.end();it++)cout<<*it<<"\n";return 0; }

加上這行std::ios::sync_with_stdio(false);并沒快多少啊

注意字符串有的時候需要自己填 ' \0 ' 有的時候會忘掉

總結

以上是生活随笔為你收集整理的【UVA - 10815】 Andy's First Dictionary（STL+字符处理）的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。