refactor 1122

Author: fishercoder1534

README.md

@@ -29,6 +29,7 @@ Your ideas/fixes/algorithms are more than welcome!
 |-----|----------------|---------------|---------------|---------------|--------|-------------|-------------
 |5087|[Letter Tile Possibilities](https://leetcode.com/problems/letter-tile-possibilities/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_5087.java) | O(1) | O(1) | |Medium||
 |5083|[Occurrences After Bigram](https://leetcode.com/problems/occurrences-after-bigram/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_5083.java) | O(n) | O(1) | |Easy||
+|1122|[Relative Sort Array](https://leetcode.com/problems/relative-sort-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1122.java) | O(n) | O(n) | |Easy||
 |1071|[Greatest Common Divisor of Strings](https://leetcode.com/problems/greatest-common-divisor-of-strings/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1071.java) | O(m*n) | O(1) | |Easy||
 |1065|[Index Pairs of a String](https://leetcode.com/problems/index-pairs-of-a-string/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1065.java) | O(nlogn) | O(1) | |Medium||
 |1056|[Confusing Number](https://leetcode.com/problems/confusing-number/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1056.java) | O(n) | O(1) | |Easy||

src/main/java/com/fishercoder/solutions/_1122.java

@@ -0,0 +1,46 @@
+package com.fishercoder.solutions;
+
+import java.util.Arrays;
+import java.util.TreeMap;
+
+/**
+ * 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 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.
+ * */
+public class _1122 {
+    public static class Solution1 {
+        public int[] relativeSortArray(int[] arr1, int[] arr2) {
+            TreeMap<Integer, Integer> map = new TreeMap<>();
+            Arrays.stream(arr1).forEach(num -> map.put(num, map.getOrDefault(num, 0) + 1));
+            int[] result = new int[arr1.length];
+            int i = 0;
+            for (int num : arr2) {
+                int count = map.get(num);
+                while (count-- > 0) {
+                    result[i++] = num;
+                }
+                map.remove(num);
+            }
+            for (int key : map.keySet()) {
+                int count = map.get(key);
+                while (count-- > 0) {
+                    result[i++] = key;
+                }
+            }
+            return result;
+        }
+    }
+}

src/test/java/com/fishercoder/_1122Test.java

@@ -0,0 +1,22 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._1122;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static org.junit.Assert.assertArrayEquals;
+
+public class _1122Test {
+    private static _1122.Solution1 solution1;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _1122.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertArrayEquals(new int[]{2, 2, 2, 1, 4, 3, 3, 9, 6, 7, 19}, solution1.relativeSortArray(new int[]{2, 3, 1, 3, 2, 4, 6, 7, 9, 2, 19}, new int[]{2, 1, 4, 3, 9, 6}));
+    }
+
+}