Andy's First Dictionary-UVA 10815
来源:互联网 发布:linux查看samba服务 编辑:程序博客网 时间:2024/06/05 18:10
题目:uva10815
水题,用STL中的set很容易 ,借用stringstream将字符串转化为一个一个的单词
代码如下:
#include<iostream>#include<set>#include<iterator>#include<string>#include<set>#include<typeinfo>#include<queue>#include<list>#include<algorithm>#include<cstdio>#include<cctype>#include<cstring>#include<map>#include<vector>#include<cstdlib>#include<cmath>#include<stack>#include<sstream>#include<iomanip>const int maxn = 30;using namespace std;set<string> dict;int main(){ string s; string buf; while(cin>>s) { for(int i = 0;i<s.size();i++){ if(isalpha(s[i])) s[i]=tolower(s[i]); else s[i]=' '; } stringstream ss; ss<<s; while(ss>>buf)dict.insert(buf); } for(set<string>::iterator it =dict.begin();it!=dict.end();it++) cout<<*it<<endl; return 0;}
stringstream的用法:
#include<iostream>#include<set>#include<iterator>#include<string>#include<set>#include<typeinfo>#include<queue>#include<list>#include<algorithm>#include<cstdio>#include<cctype>#include<cstring>#include<map>#include<vector>#include<cstdlib>#include<cmath>#include<stack>#include<sstream>#include<iomanip>const int maxn = 30;using namespace std;int main(){ stringstream ss; string x; //字符串转化为一个个的单词 { string s="You are asked to write a program that lists all the different words in the input text."; ss<<s; while(ss>>x) cout<<x<<endl; ss.clear(); } //int 转化为string { int i=1000; ss<<i; ss>>x; cout<<x<<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
- HDU 1251
- linux软件管理学习笔记
- 真正解决TextView行间距、字间距的问题
- 最强平衡树——Treap[以我的最弱击败你的最强]
- 机器学习实战——python实现Logistic回归
- Andy's First Dictionary-UVA 10815
- 学习之道
- iBatis/mybits与Hibernate
- C深度剖析读书笔记-第三章预处理
- spring 源码学习-class方法创建类
- CSDN日报20170512 ——《程序员,你为什么值这么多钱?》
- tensorflow:深入mnist代码注释
- R语言学习总结---基本数据类型
- Visual Studio杂记