1093 字符串A+B
思路:
用一个map记录每个字符是否已经出现过,出现则continue,否则输出
#include<stdio.h>
#include<iostream>
#include<map>
#include<string>
using namespace std;
map<char, int> mp;
int main(int argc, char* argv[]) {
string a;
string b;
getline(cin, a);
getline(cin, b);
for (size_t i = 0; i < a.size(); i++) {
if (mp.find(a[i]) != mp.end()) { continue; }
else {
mp[a[i]] = 1;
cout << a[i];
}
}
for (size_t i = 0; i < b.size(); i++) {
if (mp.find(b[i]) != mp.end()) { continue; }
else {
mp[b[i]] = 1;
cout << b[i];
}
}
return 0;
}