UVa 10815 Andy's First Dictionary
感觉这道题要比之前几个字符串处理的题目难度要大了一些。
题目大意:给若干行字符串,提取出所有单词并去掉重复的,最后按字典顺序输出。
对于输入大致有两种思路,一种是逐个读入字符,遇到字母的话就放到word里面,直到遇到非字母字符,在word最后放'\0'。
我采用第二种思路,就是用gets()函数逐行读到str字符数组里面,然后逐个把单词提取出来。
Count存放的是Dictionary里单词的个数,每提取一个单词,看看Dictionary里有没有该单词,没有的话放到字典里面,并且计数器加1。
由于功力不够深厚,最后对Dictionary排序的时候不会写cmp函数,因此用不了qsort(),所以又笨笨的写了个冒泡排序,居然没有超时。
Problem B: Andy's First Dictionary |
Time limit: 3 seconds |
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
国际惯例,AC代码如下:
//#define LOCAL
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std; char Dictionary[][];//用来存放单词
int Count = ; //不重复的单词的个数
char str[], word[]; int cmp(const void *a, const void *b); int main(void)
{
#ifdef LOCAL
freopen("10815in.txt", "r", stdin);
#endif int i, j;
while(gets(str))
{
int l = strlen(str);
if(l == )
continue;
for(i = ; i < l; ++i)
str[i] = tolower(str[i]);
i = ; while(i < l)
{
if((i == || str[i - ] < 'a' || str[i - ] > 'z')//判断一个单词的开始
&& str[i] >= 'a' && str[i] <= 'z')
word[] = str[i];
else
{
++i;
continue;
} ++i;
int j = ;
while(str[i] >= 'a' && str[i] <= 'z' && i < l)
{
word[j++] = str[i++];
}
word[j] = '\0'; for(j = ; j < Count; ++j)
{
if(!strcmp(Dictionary[j], word))
break;
}
if(j == Count)
strcpy(Dictionary[Count++], word);
}
} for(i = Count - ; i > ; --i)//不会用qsort,只能恶心地写个冒泡了
{
for(j = ; j < i; ++ j)
{
if(strcmp(Dictionary[j], Dictionary[j + ]) > )
{
char t[];
strcpy(t, Dictionary[j]);
strcpy(Dictionary[j], Dictionary[j + ]);
strcpy(Dictionary[j + ], t);
}
}
}
for(i = ; i < Count; ++i)
cout << Dictionary[i] << endl;
return ;
}
代码君
最后去网上查了一下别人写的cmp函数,试了一下同样AC!
int cmp(const void *a, const void *b)
{
return strcmp((char *)a, (char *)b);
}
qsort(Dictionary, Count, sizeof(Dictionary[]), cmp);
以上是我几个月前写的代码,现在看起来真挫啊!学习一下紫书STL的用法。最大的特点就是用起来方便而且代码简短不容易出错,而且速度也比我的代码快多了,以上我手写的冒泡排序运行时间为0.256s,加上快排的话大概能缩短到0.1s左右,但这份STL代码仅仅0.062s
set就是数学上的集合,每个元素都不重复。同sort一样,自定义类型也可以构造set,但同样必须定义“小于”运算符。
//#define LOCAL
#include <iostream>
#include <set>
#include <string>
#include <sstream>
using namespace std; set<string> dict; int main(void)
{
#ifdef LOCAL
freopen("10815in.txt", "r", stdin);
#endif string s, buf;
while(cin >> s)
{
for(int i = ; i < s.length(); ++i)
if(isalpha(s[i])) s[i] = tolower(s[i]); else s[i] = ' ';
stringstream ss(s);
while(ss >> buf) dict.insert(buf);
}
for(set<string>::iterator it = dict.begin(); it != dict.end(); ++it)
cout << *it << "\n"; return ;
}
飞快的代码君
UVa 10815 Andy's First Dictionary的更多相关文章
- UVA - 10815 - Andy's First Dictionary STL
Andy, 8, has a dream - he wants to produce his very own dictionary. This is not an easy task for him ...
- UVA 10815 Andy's First Dictionary (C++ STL map && set )
原题链接: https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_proble ...
- UVA 10815 Andy's First Dictionary ---set
题目链接 题意:输入一个文本,找出所有不同的单词(连续的字母序列),按字典序从小到大输出.单词不区分大小写. 刘汝佳算法竞赛入门经典(第二版)P112 #include <iostream> ...
- UVA 10815 Andy's First Dictionary【set】
题目链接:https://vjudge.net/contest/211547#problem/C 题目大意: 输入一个文本,找出所有不同的单词(连续的字母序列),按字典序从小到大输出,单词不区分大小写 ...
- Uva 10815 Andy's First Dictionary(字符串)
题目链接:https://vjudge.net/problem/UVA-10815 题意 找出一段文本中的所有单词,以小写形式按照字典序输出. 思路 用空白符替换文本中所有非字母字符后再次读入. 代码 ...
- UVA 10815 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 ...
- UVa10815.Andy's First Dictionary
题目链接:http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem& ...
- UVA-10815 Andy's First Dictionary (非原创)
10815 - Andy's First Dictionary Time limit: 3.000 seconds Problem B: Andy's First DictionaryTime lim ...
- 【UVA - 10815】Andy's First Dictionary (set)
Andy's First Dictionary Description 不提英文了 直接上中文大意吧 XY学长刚刚立下了再不过CET就直播xx的flag,为了不真的开启直播模式,XY学长决定好好学习英 ...
随机推荐
- css hack一览
浏览器对css hack的支持情况
- LCIS(m*n) 最长公共上升子序列
详见:http://wenku.baidu.com/view/3e78f223aaea998fcc220ea0n3的: for(int i=1;i<=n;i++) for ...
- Sqli-labs less 57
Less-57 从代码中看到对id进行了 " " 的处理,所以此处我们构造的payload要进行 "" 的处理,示例payload: http://127.0. ...
- 通过登入IP记录Linux所有用户登录所操作的日志
通过登入IP记录Linux所有用户登录所操作的日志 对于Linux用户操作记录一般通过命令history来查看历史记录,但是如果在由于误操作而删除了重要的数据的情况下,history命令就不会有什么作 ...
- awk处理之案例三:awk去掉不需要的文本行
编译环境 本系列文章所提供的算法均在以下环境下编译通过. [脚本编译环境]Federa 8,linux 2.6.35.6-45.fc14.i686 [处理器] Intel(R) Core(TM)2 Q ...
- mvc5 知识点01
1.ViewBag 动态数据类型,也就是说可以随便指定属性,前后台传值很是有用 2.Layout 属性,定义模版,模版中一般用@RenderBody() 做占位符,用于放置子页面内容 3.@model ...
- Google Protocol Buffers简介
什么是 protocol buffers ? Protocol buffers 是一种灵活.高效的序列化结构数据的自动机制--想想XML,但是它更小,更快,更简单.你只需要把你需要怎样结构化你的数据定 ...
- http://blog.sina.com.cn/s/blog_5b9b4abe01017638.html
http://blog.sina.com.cn/s/blog_5b9b4abe01017638.html
- Windows 下 玩转Node.JS
vs一直是用的比较舒服的IDE,一直期望可以支持Node.JS.终于找到了一个工具 NTVS(Node.JS Tool For VS). 主页:https://nodejstools.codeplex ...
- 批处理命令 - if
0.功能 Performs conditional processing in batch programs. 执行批处理程序中的条件处理. 1.简介 IF [NOT] ERRORLEVEL numb ...