_1122.java

packagecom.fishercoder.solutions.secondthousand;

importjava.util.Arrays;
importjava.util.TreeMap;

publicclass_1122 {
publicstaticclassSolution1 {
publicint[] relativeSortArray(int[] arr1, int[] arr2) {
TreeMap<Integer, Integer> map = newTreeMap<>();
Arrays.stream(arr1).forEach(num -> map.put(num, map.getOrDefault(num, 0) + 1));
int[] result = newint[arr1.length];
inti = 0;
for (intnum : arr2) {
intcount = map.get(num);
while (count-- > 0) {
result[i++] = num;
 }
map.remove(num);
 }
for (intkey : map.keySet()) {
intcount = map.get(key);
while (count-- > 0) {
result[i++] = key;
 }
 }
returnresult;
 }
 }
}