|
3 | 3 | importjava.util.Arrays; |
4 | 4 | importjava.util.TreeMap; |
5 | 5 |
|
6 | | -/** |
7 | | - * 1122. Relative Sort Array |
8 | | - * |
9 | | - * Given two arrays arr1 and arr2, the elements of arr2 are distinct, and all elements in arr2 are also in arr1. |
10 | | - * Sort the elements of arr1 such that the relative ordering of items in arr1 are the same as in arr2. |
11 | | - * Elements that don't appear in arr2 should be placed at the end of arr1 in ascending order. |
12 | | - * |
13 | | - * Example 1: |
14 | | - * Input: arr1 = [2,3,1,3,2,4,6,7,9,2,19], arr2 = [2,1,4,3,9,6] |
15 | | - * Output: [2,2,2,1,4,3,3,9,6,7,19] |
16 | | - * |
17 | | - * Constraints: |
18 | | - * arr1.length, arr2.length <= 1000 |
19 | | - * 0 <= arr1[i], arr2[i] <= 1000 |
20 | | - * Each arr2[i] is distinct. |
21 | | - * Each arr2[i] is in arr1. |
22 | | - * */ |
23 | 6 | publicclass_1122 { |
24 | 7 | publicstaticclassSolution1 { |
25 | 8 | publicint[]relativeSortArray(int[]arr1,int[]arr2) { |
|