描述
Given two arrays arr1 and arr2, the elements of arr2 are distinct, and all elements in arr2 are also in arr1.
Sort the elements of arr1 such that the relative ordering of items in arr1 are the same as in arr2. Elements that don't appear in arr2 should be placed at the end of arr1 in ascending order.
Example 1:
Input: arr1 = [2,3,1,3,2,4,6,7,9,2,19], arr2 = [2,1,4,3,9,6]
Output: [2,2,2,1,4,3,3,9,6,7,19]
Note:
- 1 <= arr1.length, arr2.length <= 1000
- 0 <= arr1[i], arr2[i] <= 1000
- All the elements of arr2 are distinct.
- Each arr2[i] is in arr1.
解析
根据题意，先对 arr1 用字典 c 统计元素及其对应的数量，遍历 arr2 中的元素，利用 c 中的对应数量，生成初步的 res ，遍历结束之后，将 arr1 中剩余的元素按照升序排序追加到 res 之后即可。
解答
class Solution(object):
def relativeSortArray(self, arr1, arr2):
"""
:type arr1: List[int]
:type arr2: List[int]
:rtype: List[int]
"""
res = []
c = collections.Counter(arr1)
for x in arr2:
res += [x] * c.pop(x)
return res + sorted(c.elements())
运行结果
Runtime: 24 ms, faster than 76.62% of Python online submissions for Relative Sort Array.
Memory Usage: 13.7 MB, less than 27.61% of Python online submissions for Relative Sort Array.
原题链接：leetcode.com/problems/re…
您的支持是我最大的动力
