UVA10815 Andy's First Dictionary(字符串)
2017-07-28 18:27
459 查看
题目:
题目:
字符串处理,直接看代码吧
代码:
代码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 0x3f3f3f3f
using 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]);
else
str[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;
}
题目:
字符串处理,直接看代码吧
代码:
#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 0x3f3f3f3f using 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]; } else k++; } 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 0x3f3f3f3f
using 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]);
else
str[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;
}
相关文章推荐
- uva 10815 Andy's First Dictionary(字符串处理+sort排序)
- UVA 10815 (暑假-字符串(2) -D - Andy's First Dictionary)
- UVA ~ 10815 ~ Andy's First Dictionary(set+字符串处理)
- UVa10815_Andy's First Dictionary(小白书字符串专题)
- UVA - 10815 Andy's First Dictionary
- UVA 10815-Andy's First Dictionary
- 紫书章5例三 Andy's First Dictionary, UVA 10815(set)
- UVA - 10815 Andy's First Dictionary
- uva-10815-Andy's First Dictionary-stl-set
- 字符串-10815 Andy’s First Dictionary
- Andy's First Dictionary UVA - 10815
- uva 10815 Andy's First Dictionary
- Andy's First Dictionary ——Uva 10815
- UVA 10815 Andy's First Dictionary
- UVa-10815 - Andy's First Dictionary
- UVa 10815 Andy's First Dictionary
- UVa-10815-Andy's First Dictionary c++ STL set 基础练习题
- UVA 10815 Andy's First Dictionary
- Andy's First Dictionary UVA - 10815
- UVA - 10815 Andy's First Dictionary