791. Custom Sort String
- Custom Sort String python solution
题目描述
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.
解析
这个题目很好理解,只需要将T中的字母按照S中字母的顺序排布即可。而且S中不含有重复字母,对于在T中而不在S中的字母,其排列顺序任意。
// An highlighted block
class Solution:
def customSortString(self, S: str, T: str) -> str:
ans=""
for l in S:
if l in T:
ans+=l*T.count(l)
T=T.replace(l,"")
return ans+T