这道题感觉意思表述的不清楚,
class Solution {
public:
string customSortString(string S, string T) {
// gain map
std::map<char, int> count;
for (int i='a';i<='z';i++){
count[i] = 0;
}
// gain T counts
for (int ii=0;ii<T.size();ii++){
count[T[ii]] ++;
}
// return results
string result = "";
for (int i=0;i<S.size();i++){
for (int j=0;j<count[S[i]];j++){
result += S[i];
}
count[S[i]]=0;
}
// write left results
for (int i='a';i<='z';i++){
for (int j=0;j<count[i];j++){
result += i;
}
}
return result;
}
};