UVA10815 Andy's First Dictionary(字符串)

来源:互联网 发布:数据帧结构 编辑:程序博客网 时间:2024/05/21 10:08

题目:


题目:

字符串处理,直接看代码吧

代码:

#include <cstdio>#include <cstring>#include <cstdlib>#include <cmath>#include <string>#include <iostream>#include <stack>#include <queue>#include <vector>#include <algorithm>#define mem(a,b) memset(a,b,sizeof(a))#define N 330#define M 10000+20#define MOD 1000000000+7#define inf 0x3f3f3f3fusing namespace std;string s[1000000];int main(){string str;int k = 0;while (cin >> str){for (int i = 0; i < str.length(); i++){if (isalpha(str[i])){str[i] = tolower(str[i]);s[k] += str[i];}elsek++;}k++;}sort(s, s + k);for (int i = 1; i < k; i++){if (s[i] != s[i - 1] && isalpha(s[i][0]))cout << s[i] << endl;}return 0;}


代码2(SET)

#include <cstdio>#include <cstring>#include <cstdlib>#include <cmath>#include <string>#include <iostream>#include <stack>#include <set>#include <queue>#include <sstream>#include <vector>#include <algorithm>#define mem(a,b) memset(a,b,sizeof(a))#define N 330#define M 10000+20#define MOD 1000000000+7#define inf 0x3f3f3f3fusing namespace std;set<string>dict;int main(){string str,s;while(cin>>str){for(int i=0; i<str.length(); i++)if(isalpha(str[i]))str[i] = tolower(str[i]);elsestr[i]=' ';stringstream ss(str);while(ss>>s)dict.insert(s);}for(set<string>::iterator it=dict.begin(); it!=dict.end(); it++)cout<<*it<<endl;return 0;}


原创粉丝点击