Winter-2-STL-E Andy's First Dictionary 解题报告及测试数据

use stringstream

Time Limit:3000MS     Memory Limit:0KB

Description

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

题解：

这道题最重要的就是stringstream的使用。

  1. 使用getline(cin,string)函数整行读取。之所以不直接读取，是因为两个单词间有标点符号时，会误读为一个单词，还是需要后续的处理。
  2. 由于最后要求输出的是小写，也方便排序，那么每输入一行就进行标点变为空格，大写变为小写的变换。处理完之后，就需要用到stringstream（字符串流）类，头文件是<sstream>，例如stringstream ss,ss.clear()是将字符串流清空，ss.str(string)是将ss读入对象初始化为形参 string，那么执行ss>>str，那么执行 while(ss>>str[k])k++;就可以将不带空格的字符串一一读入，从而实现了单词之间的分离。
  3. ?排序之后，使用pre记录刚刚输出的字符串，如果当前字符串与pre相同，则是重复的，不输出。因为排序后相同的字符串是连在一块的，所以用这种方法就将重复的全部排除了。

以下是代码：


1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

#include <iostream>

#include <string>

#include <cstring>

#include <algorithm>

#include <cctype>

#include <sstream>

using namespace std;

string str[100000],s;

stringstream ss;

int k=0;

int main(){

    //freopen("1.in","r",stdin);

    while(getline(cin,s)){

        int len = s.length();

        for(int i=0;i<len;i++){//将标点变为空格，大写变为小写。

            char ch = s.at(i);

            if(islower(ch))continue;

            if(isupper(ch))s.at(i)-=‘A‘-‘a‘;

            else s.at(i)=‘ ‘;

        }

        ss.clear();

        ss.str(s);

        while(ss>>str[k])k++;

    }

    sort(str,str+k);//排序

    string pre="";

    for(int i=0;i<k;i++){

        if(str[i]==pre)continue;//重复的不输出

        cout << str[i]<<endl;

        pre =str[i];

    }

}

Winter-2-STL-E Andy's First Dictionary 解题报告及测试数据

时间： 2024-03-29 15:41:15

Winter-2-STL-E Andy's First Dictionary 解题报告及测试数据的相关文章

UVa - 10815 Andy&#39;s First Dictionary(STL)

题目链接:http://acm.hust.edu.cn/vjudge/problem/viewProblem.action?id=18649 #include <iostream> #include <string> #include <set> #include <sstream> using namespace std; /******************************************************************

UVa10815 Andy&#39;s First Dictionary （STL）

链接:http://acm.hust.edu.cn/vjudge/problem/18649分析:set容器应用.set中每个元素最多只出现一次.自定义类型也可以构造set,必须定义“小于”运算符.set中的元素从小到大已排好序. 1 #include <iostream> 2 #include <string> 3 #include <cctype> 4 #include <set> 5 #include <sstream> 6 using n

UVA10815 Andy&#39;s First Dictionary

问题链接:UVA10815 Andy's First Dictionary. 题意简述:输入一个文本文件,从中提取出字典,重复的单词被去掉. 这个问题用C++语言编写程序,主要是为了练习使用STL的功能.另外一点,C++编写程序效率会更高. 使用STL容器类的set,可以方便地去重复,而且还会自动排序. 程序中,使用C语言的库函数strtok()来切割单词,并且用空格' '作为分隔符.这是一种简便的做法. 另外一种切割字符串的方法是,使用STL的字符串流(sstream)实现. AC的C++程序

UVA - 10815 Andy&#39;s First Dictionary

1 #include <iostream> 2 #include <cstring> 3 #include <algorithm> 4 #include <set> 5 using namespace std; 6 7 set<string> out; 8 9 int main() 10 { 11 string s,temp; 12 while(cin>>s) 13 { 14 int len(s.size()); 15 for(int

Andy&#39;s First Dictionary

Description 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. F

UVA 10815 Andy&#39;s First Dictionary（字符处理）

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 book

10815 - Andy&#39;s First Dictionary解答

采用数组链表的方式,来插入读入的单词,逐个字符读入单词. #include <stdio.h> #define LEN 200 #include <string> #include <string.h> #include <stdlib.h> struct node { char word[LEN]; struct node * next; }; typedef struct node Word; int main(){ Word* Dict[30]; fo

小白书训练-Andy&#39;s First Dictionary

题目链接:http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=1756 题意:给你一段文字,把所有的单词挑出来,然后排序打印. 首先是挑出来,用指针加数组轻轻松解决问题,然后排序,因为用数组不能快拍,便用了string,先转换为string然后一个快拍. 打印的时候不能打印重复的,因此,在打印的时候一个判断就好. 因为数组大小问题RE到死啊啊啊啊

安迪的第一个字典 Andy&#39;s First Dictionary, UVa 10815

(Time limit: 3 seconds) Andy, 8, has a dream - he wants to produce hisvery own dictionary. This is not an easy task forhim, as the number of words that he knows is,well, not quite enough. Instead of thinking up allthe words himself, he has a briliant