LeetCode --- 1122. Relative Sort Array 解题报告

Posted 杨鑫newlfe

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了LeetCode --- 1122. Relative Sort Array 解题报告相关的知识,希望对你有一定的参考价值。

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 do not 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]

Example 2:

Input: arr1 = [28,6,22,8,44,17], arr2 = [22,28,8,6]
Output: [22,28,8,6,17,44]

Constraints:

  • 1 <= arr1.length, arr2.length <= 1000
  • 0 <= arr1[i], arr2[i] <=

以上是关于LeetCode --- 1122. Relative Sort Array 解题报告的主要内容,如果未能解决你的问题,请参考以下文章

20.11.14 leetcode1122(自定义排序)

[LeetCode] 1122. Relative Sort Array 数组的相对排序

leetcode简单1122数组的相对排序

leetcode_easy_array1122. Relative Sort Array

Golang语言LeetCode1122. Relative Sort Array

LeetCode 1122. Relative Sort Array (数组的相对排序)