relative-sort-array

java

python3

python

javascript

typescript

csharp

golang

kotlin

swift

rust

ruby

dart

scala

elixir

erlang

racket

cangjie

bash

mysql

mssql

postgresql

oraclesql

pythondata

Algorithms

Given two arrays <code>arr1</code> and <code>arr2</code>, the elements of <code>arr2</code> are distinct, and all elements in <code>arr2</code> are also in <code>arr1</code>.

Sort the elements of <code>arr1</code> such that the relative ordering of items in <code>arr1</code> are the same as in <code>arr2</code>. Elements that do not appear in <code>arr2</code> should be placed at the end of <code>arr1</code> in ascending order.

&nbsp;
Example 1:

<pre>
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]
</pre>

Example 2:

<pre>
Input: arr1 = [28,6,22,8,44,17], arr2 = [22,28,8,6]
Output: [22,28,8,6,17,44]
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= arr1.length, arr2.length &lt;= 1000</code></li>
	<li><code>0 &lt;= arr1[i], arr2[i] &lt;= 1000</code></li>
	<li>All the elements of <code>arr2</code> are distinct.</li>
	<li>Each&nbsp;<code>arr2[i]</code> is in <code>arr1</code>.</li>
</ul>

&#31532; 145 &#22330;&#21608;&#36187;

weekly-contest-145

relativeSortArray

&#20013;&#32423;&#24037;&#31243;&#24072;

Relative Sort Array

Array

Hash Table

Counting Sort

Sorting

&#32473;&#20320;&#20004;&#20010;&#25968;&#32452;&#65292;<code>arr1</code> &#21644;&nbsp;<code>arr2</code>&#65292;<code>arr2</code>&nbsp;&#20013;&#30340;&#20803;&#32032;&#21508;&#19981;&#30456;&#21516;&#65292;<code>arr2</code> &#20013;&#30340;&#27599;&#20010;&#20803;&#32032;&#37117;&#20986;&#29616;&#22312;&nbsp;<code>arr1</code>&nbsp;&#20013;&#12290;

&#23545; <code>arr1</code>&nbsp;&#20013;&#30340;&#20803;&#32032;&#36827;&#34892;&#25490;&#24207;&#65292;&#20351; <code>arr1</code> &#20013;&#39033;&#30340;&#30456;&#23545;&#39034;&#24207;&#21644;&nbsp;<code>arr2</code>&nbsp;&#20013;&#30340;&#30456;&#23545;&#39034;&#24207;&#30456;&#21516;&#12290;&#26410;&#22312;&nbsp;<code>arr2</code>&nbsp;&#20013;&#20986;&#29616;&#36807;&#30340;&#20803;&#32032;&#38656;&#35201;&#25353;&#29031;&#21319;&#24207;&#25918;&#22312;&nbsp;<code>arr1</code>&nbsp;&#30340;&#26411;&#23614;&#12290;

&nbsp;

&#31034;&#20363; 1&#65306;

<pre>
&#36755;&#20837;&#65306;arr1 = [2,3,1,3,2,4,6,7,9,2,19], arr2 = [2,1,4,3,9,6]
&#36755;&#20986;&#65306;[2,2,2,1,4,3,3,9,6,7,19]
</pre>

&#31034;&#20363; &nbsp;2:

<pre>
&#36755;&#20837;&#65306;arr1 = [28,6,22,8,44,17], arr2 = [22,28,8,6]
&#36755;&#20986;&#65306;[22,28,8,6,17,44]
</pre>

&nbsp;

&#25552;&#31034;&#65306;

<ul>
	<li><code>1 &lt;= arr1.length, arr2.length &lt;= 1000</code></li>
	<li><code>0 &lt;= arr1[i], arr2[i] &lt;= 1000</code></li>
	<li><code>arr2</code>&nbsp;&#20013;&#30340;&#20803;&#32032;&nbsp;<code>arr2[i]</code>&nbsp;&nbsp;&#21508;&#19981;&#30456;&#21516;&nbsp;</li>
	<li><code>arr2</code> &#20013;&#30340;&#27599;&#20010;&#20803;&#32032;&nbsp;<code>arr2[i]</code>&nbsp;&#37117;&#20986;&#29616;&#22312;&nbsp;<code>arr1</code>&nbsp;&#20013;</li>
</ul>

Sunbelt Computer Software

PL/B Language Development and Support