UVA - 10815 Andy's First Dictionary
来源:互联网 发布:犀牛软件分割模型 编辑:程序博客网 时间:2024/05/19 14:15
UVA - 10815 Andy’s First Dictionary
题目大意:输入一段文字,以EOF结束,把这段文字中出现的单词以小写按字母顺序排列,类似字典那样。
解题思路:一个字符一个字符地读,isalpha( ) 判断是否为字母,是就存到数组中。qsort ( ) 排序,原理其实不太理解,照着小白写的。输出控制前后不相等的输出即可。
以 EOF 结束输入卡了好久……
#include<iostream>#include<cstring>#include<cstdio>#include<ctype.h>#include<algorithm>using namespace std;int cmp( const void *q , const void *w ) { return strcmp( (char*)q , (char*)w );}int main() { char a[100000][500] , b; int i = 0 , j = 0; memset(a,'\0',sizeof(a)); while( (b = getchar()) != -1 ) { if(isalpha(b)) { b = tolower(b); a[i][j] = b; j++; } else { a[i][j] = '\0'; i++; j = 0; } } qsort(a , i , sizeof(a[0]),cmp); for( j = 0; j < i ; j++ ) { if(isalpha(a[j][0])) if( strcmp( a[j] ,a[j+1]) ) cout << a[j] << endl; } return 0;}
0 0
- UVa OJ 10815-Andy's First Dictionary
- uva 10815 Andy's First Dictionary
- UVa 10815 - Andy's First Dictionary
- UVA 10815 - Andy's First Dictionary
- uva-10815 - Andy's First Dictionary
- UVa 10815 - Andy's First Dictionary
- UVA 10815 Andy's First Dictionary
- UVa 10815 - Andy's First Dictionary
- UVA 10815 Andy's First Dictionary
- UVa-10815 - Andy's First Dictionary
- UVA 10815 - Andy's First Dictionary
- uva -- 10815 Andy's First Dictionary
- UVA 10815 Andy's First Dictionary
- uva 10815 Andy's First Dictionary
- UVa 10815 - Andy's First Dictionary
- uva - 10815 - Andy's First Dictionary
- UVA 10815 Andy's First Dictionary
- Uva 10815 - Andy's First Dictionary
- 继承 多态 封装 NSObject类 super关键字 里氏替换 原则 SEL数据 Class
- UVA - 10010 Where's Waldorf?
- UVA - 409 Excuses, Excuses!
- NodeJs——(17)myblog的优化【2】用fs模块来记录访问情况
- UVA - 10115 Automatic Editing
- UVA - 10815 Andy's First Dictionary
- 51Nod-1105-第K大的数
- UVA - 10106 Product
- UVA - 424 Integer Inquiry
- UVA - 465 Overflow
- acdream 1007 a+b 快速幂取模
- UVA - 10879 Code Refactoring
- unity中跳跃的实现
- UVA - 10112 Myacm Triangles