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
x should occur before
y in the returned string.
Return any permutation of
T (as a string) that satisfies this property.
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.
Shas length at most
26, and no character is repeated in
Thas length at most
Tconsist of lowercase letters only.
Solution in Python
from collections import Counter class Solution: def customSortString(self, S: str, T: str) -> str: S_COUNT = Counter(S) T_COUNT = Counter(T) PREFIX = "" SUFFIX = "" for i in S: if i in T: PREFIX+= i*T_COUNT[i] del T_COUNT[i] for i in T_COUNT: SUFFIX+= i*T_COUNT[i] return PREFIX+SUFFIX