Description:
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]
Constraints:
- arr1.length, arr2.length <= 1000
- 0 <= arr1[i], arr2[i] <= 1000
- Each arr2[i] is distinct.
- Each arr2[i] is in arr1.
题意:对数组 a r r 1 arr1 arr1进行排序,要求首先按照 a r r 2 arr2 arr2中元素出现的顺序排序,最后将没有出现在 a r r 2 arr2 arr2中的元素按照升序排序排列在数组 a r r 1 arr1 arr1的尾部;
解法:首先,要按照 a r r 2 arr2 arr2中的顺序排序,需要找出 a r r 1 arr1 arr1中出现的所有这些元素;因此,第一步,利用哈希表存储 a r r 1 arr1 arr1中的所有元素出现的次数后,遍历 a r r 2 arr2 arr2中的元素 k e y key key,将 a r r 1 arr1 arr1中出现的所有 k e y key key插入到结果数组中;第二步,将没有在 a r r 2 arr2 arr2中出现的元素插入到结果数组的尾部;最后,对结果数组尾部那部分数组进行排序;
Java
class Solution {
public int[] relativeSortArray(int[] arr1, int[] arr2) {
HashMap<Integer, Integer> map = new HashMap<>();
for (int arr: arr1) {
map.put(arr, map.getOrDefault(arr, 0) + 1);
}
int[] result = new int[arr1.length];
int ind = 0;
for (int i = 0; i < arr2.length; i++) {
for (int j = 0; j < map.get(arr2[i]); j++) {
result[ind++] = arr2[i];
}
map.remove(arr2[i]);
}
int st = ind;
for (int k: map.keySet()) {
for (int i = 0; i < map.get(k); i++) {
result[ind++] = k;
}
}
Arrays.sort(result, st, result.length);
return result;
}
}