LeetCode 791. Custom Sort String解题报告(python)

orientliu96

于 2019-11-26 10:13:33 发布

阅读量203

点赞数

分类专栏： LeetCode 文章标签： python leetcode

本文链接：https://blog.csdn.net/Orientliu96/article/details/103251105

版权

LeetCode 专栏收录该内容

98 篇文章

订阅专栏

本文介绍了一种基于定制顺序的字符串排序算法，通过Python实现，确保T字符串中的字符按S字符串预定义的顺序排列。未在S中出现的字符保持原有顺序。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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