LeetCode 791. 自定义字符串排序

示例:
输入:
S = "cba"
T = "abcd"
输出: "cbad"
解释: 
S中出现了字符 "a", "b", "c", 所以 "a", "b", "c" 的顺序应该是 "c", "b", "a". 
由于 "d" 没有在S中出现, 它可以放在T的任意位置. "dcba", "cdba", "cbda" 都是合法的输出。

class Solution:
    def customSortString(self, order: str, s: str) -> str:
        ret = ""
        sList = list(s)
        for i in order:
            # print(i)
            while True:
                # 利用remove的特性，把對應字母刪增，直到沒法進行為止
                try:
                    sList.remove(i)
                    ret += i
                    # print(ret)
                except:
                    break
        ret += "".join(sList)
        return ret



if __name__ == '__main__':
    S = "cba"
    T = "abcddd"
    ret = Solution().customSortString(S, T)
    print(ret)