178.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 :
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.

Note:

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.

链接

https://leetcode.com/problems/custom-sort-string/description/

分析

问题转化为根据S指定的顺序输出T对应的字符串；
Step1：遍历T中的字符，统计各个字符出现的次数，存储在数组tmp内；如a如果出现3次，则tmp[0] = 3; d出现两次，则tmp[3] = 2;
Step2：遍历S中的字符，找出对应的tmp对应下标对应的值，输出几次，如如遇T中字符为d，则打印2两次d，然后tmp[3]置为0；
Step3：输出tmp中不为0的元素对应的字符，如T中不包含y,但是tmp[24]=3,说明S中有3个y，则接着输出3个y；

代码

 def customSortString(self, S, T):
        """
        :type S: str
        :type T: str
        :rtype: str
        """
        re = ""
        tmp = [0 for x in range(0, 26)] #定义一个有26个元素的初始值为0的数组tmp
        for c in T:
            tmp[ord(c) - 97] += 1  #ord(c)求一个字符c的ASII值


        for c in S:
            while tmp[ord(c)-97]  > 0:
                re += c
                tmp[ord(c) - 97] -= 1


        for i in range (0, 26):
             while tmp[i]  > 0:
                    re += chr(i + 97) #chr(num) 转换成ASII码为num的字符
                    tmp[i] -= 1

        return re

python知识点

• ord(c)求一个字符c的ASII值
• chr(num) 转换成ASII码为num的字符