UVA - 10815 Andy's First Dictionary
2016-03-12 11:24
232 查看
Andy'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 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.
题目:给出一串单词,把所有单词改小写去重按字典序输出。
思路:set可以解决去重和排序问题。
set中每个元素最多只出现一次
set中的元素已经从小到大排序好
如何通过迭代器从小到大遍历所有元素
for (set<string>::iterator i = d.begin(); i != d.end(); i++)
cout << *i << endl;
代码:
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
题目:给出一串单词,把所有单词改小写去重按字典序输出。
思路:set可以解决去重和排序问题。
set中每个元素最多只出现一次
set中的元素已经从小到大排序好
如何通过迭代器从小到大遍历所有元素
for (set<string>::iterator i = d.begin(); i != d.end(); i++)
cout << *i << endl;
代码:
#include<iostream> #include<set> #include<cstring> #include<cstdio> using namespace std; set<string> a; string c; int main() { while(getline(cin,c)) { for(int i=0;i<c.size();i++) { if(!isalpha(c[i])) continue; string b; while(isalpha(c[i])) { b+=tolower(c[i]); i++; } a.insert(b); } } set<string>::iterator it; for(it=a.begin();it!=a.end();it++) { cout<<*it<<endl; } return 0; }
相关文章推荐
- 浅关堆排序
- 关于C++中友元的理解和应用
- android TP驱动中 生产节点
- 解决方案-Genymotion 首次安装登陆时出现generic unknown error
- 生成json数据结构
- c++中引用和指针的区别
- Java基础知识(一)
- libpng warning: iCCP: Not recognizing known sRGB profile that has been edited
- 二柱子-四则运算2
- 第二次作业------------对于网易云音乐的用户评测
- Linux 网络编程 套接字选项
- CoreData简单实用
- 无线通信设计秘密四:唤醒下发算法
- 运算符重载
- python with as用法
- Win32学习笔记 - 菜单相关函数(一)
- Handwriting Number Recognition Using Python 2.7.11
- 数据结构-图-经典算法(一)
- Hadoop-Windows下的Eclipse开发环境搭建,远程虚拟机Hadoop服务器
- iOS开发 APP的国际化与本地化