leetcode1122

import collections
class Solution:
    def relativeSortArray(self, arr1: 'List[int]', arr2: 'List[int]') -> 'List[int]':
        n1 = len(arr1)
        n2 = len(arr2)
        if n2 == 0:
            return arr1
        distinct = collections.OrderedDict()
        others = []
        for i in range(n2):
            distinct[arr2[i]] = 0
        #print(distinct)
        for j in range(n1):
            if arr1[j] in distinct:
                distinct[arr1[j]] += 1
            else:
                others.append(arr1[j])
        res = []
        for k,v in distinct.items():
            res = res + [k] * v
        others = sorted(others)
        res = res + others
        return res

先记录arr2中元素，在arr1中出现的次数，保存为有序字典。另保存不在arr2中的元素。

先拼接字典中的元素，再对另外部分排序，追加到结果数组的末尾。