Andy's First Dictionary

左手的ㄟ右手 2022-05-12 05:50 144阅读 0赞

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. ![这里写图片描述][70]  
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 de ned as a consecutive se-  
quence of alphabets, in upper and/or lower case.  
Words with only one letter are also to be considered. Furthermore, your program must be CaSe In-  
SeNsItIvE. For example, words like \\Apple”, \\apple” or \\APPLE” must be considered the same.  
Input  
The input le 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  
分析：

/*输入一个文本，找出所有不同的单词（连续的字母序列），
    按照字典序从小到大输出单词不区分大小写*/
    //ps 对于缩写 I'm 去除'后为I和m两个单词

用到的函数：

1.isalpha()判断字符是否为英文字母，若为英文字母，返回非0（小写字母为2，大写字母为1）。若不是字母，返回0
    2.//tolower()功能是把字母字符转换成小写，非字母字符不做出处理

代码总览：

#include <cstdio>
    #include <iostream>
    #include <cstring>
    #include <set>
    using namespace std;
    set<string>s1;
    int main()
    {
        string str,str1;
        while(cin>>str)
        {
            for(int i=0;i<str.length();i++)
            {
                if(isalpha(str[i]))
                {
                    str[i]=tolower(str[i]);
                    str1+=str[i];
                }
                else{
                 if(str1.length())
                 {
                    s1.insert(str1);
                    str1.clear();
                 }//这里当输入的字符不是英文字符时，进行的处理，放在set中，分段处理
                }
            }
            if(str1.length())
            {
                s1.insert(str1);
                str1.clear();
            }
        }
        set<string>::iterator it;
        for(it=s1.begin();it!=s1.end();it++)
        {
            cout<<*it<<endl;
        }
        return 0;
    }

[70]: /images/20220512/1d8bd3d7d0c34dff8ac3ef9ca6c90c0a.png