A家的題暇检。
解法1直接sort,
class Solution {
public:
string customSortString(string S, string T) {
if(S.empty()){
return T;
}
auto comp = [&S](const char c1, const char c2){
return S.find(c1) < S.find(c2);
};
sort(T.begin(), T.end(), comp);
return T;
}
};
解法二：記下string T中每個(gè)char的個(gè)數(shù)吆寨，然后再loop S, 按照S的順序recover出來(lái)
class Solution {
public:
string customSortString(string S, string T) {
unordered_map<char, int> mp;
for(char c : T){
mp[c]++;
}
string ret = "";
for(char c : S){
if(mp.count(c)){
int cnt = mp[c];
ret += string(cnt, c);
mp.erase(c);
}
}
for(auto it : mp){
char c = it.first; int cnt = it.second;
ret += string(cnt, c);
}
return ret;
}
};
