这道题的两个需要注意的细节在于:
1.要分辨是字符串内重复还是字符串间重复(S1中有n个a都是允许的,但是S1和S2都有a不可以);
2.要按照字母在字符串中出现的先后顺序连接,所以只用hash表打印是不行的。
class Solution {
public:
string concatenetedString(string &s1, string &s2) {
map<char, int> rec;
string res;
for (int i = 0; i<s1.length(); i++)
if (!rec.count(s1[i])) rec.insert(pair<char, int>(s1[i], 1));
for (int i = 0; i<s2.length(); i++)
if (!rec.count(s2[i])) rec.insert(pair<char, int>(s2[i], -1));
else if (rec[s2[i]] == 1) rec[s2[i]] = 0;
for (int i = 0; i<s1.length(); i++)
if (rec[s1[i]]!=0) res = res + s1[i];
for (int i = 0; i<s2.length(); i++)
if (rec[s2[i]]!=0) res = res + s2[i];
return res;
}
};