| ||||||||||
| Online Judge | Problem Set | Authors | Online Contests | User | ||||||
|---|---|---|---|---|---|---|---|---|---|---|
| Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest | |||||||||
这题有什么要注意的地方? 还是我考虑的太简单了?#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
void main() {
char a[1001], b[1001];
int len, l, i, j;
while(cin >> a >> b) {
len = strlen(a);
l = strlen(b);
sort(a, a+len);
sort(b, b+l);
j = 0;
i = 0;
string ans = "";
while(i < len && j < l) {
if(a[i] == b[j]) {
ans += a[i];
i++;
j++;
}
else if(a[i] < b[j])
i++;
else
j++;
}
cout << ans << endl;
}
}
不就是找两个字符串中出现的相同的字母
Followed by:
Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator