LintCode 1025: Custom Sort String

1025. Custom Sort String

S and T are strings composed of lowercase letters. In S, no letter occurs more than once.

S was sorted in some custom order previously. We want to permute the characters of T so that they match the order that S was sorted. More specifically, if x occurs before y in S, then x should occur before y in the returned string.

Return any permutation of T (as a string) that satisfies this property.

Example
Example :
Input:
S = “cba”
T = “abcd”
Output: “cbad”
Explanation:
“a”, “b”, “c” appear in S, so the order of “a”, “b”, “c” should be “c”, “b”, and “a”.
Since “d” does not appear in S, it can be at any position in T. “dcba”, “cdba”, “cbda” are also valid outputs.

Notice
S has length at most 26, and no character is repeated in S.
T has length at most 200.
S and T consist of lowercase letters only.

解法1：

class Solution {
public:
    /**
     * @param S: The given string S
     * @param T: The given string T
     * @return: any permutation of T (as a string) that satisfies this property
     */
    string customSortString(string &S, string &T) {
        int m = S.size();
        int n = T.size();
        vector<int> counter(26);
        
        for (int i = 0; i < n; ++i) counter[T[i] - 'a']++;
        
        string result;
        for (int i = 0; i < m; ++i) {
            if (counter[S[i] - 'a'] > 0) result = result + string(counter[S[i] - 'a'], S[i]);
        }
        for (int i = 0; i < n; ++i) {
            if (counter[T[i] - 'a'] == 0) result = result + T[i];
        }
        
        return result;
    }
};

代码同步在
https://github.com/luqian2017/Algorithm