solves relative sort array

Author: anishLearnsToCode

README.md

@@ -299,7 +299,7 @@
 | 1108 | [Defanging an IP Address](https://leetcode.com/problems/defanging-an-ip-address)                                                                     |                                                          [![Java](assets/java.png)](src/DefangingAnIPAddress.java)                                                          |                                                                                                                                   |
 | 1118 | 🔒 [Number of Days in a Month](https://leetcode.com/problems/number-of-days-in-a-month)                                                              |                                                                                                                                                                             |                                                                                                                                   |
 | 1119 | 🔒 [Remove Vowels From String](https://leetcode.com/problems/remove-vowels-from-a-string)                                                            |                                                                                                                                                                             |                                                                                                                                   |
-| 1122 | [Relative Sort Array](https://leetcode.com/problems/relative-sort-array)                                                                             |                                                                                                                                                                             |                                                                                                                                   |
+| 1122 | [Relative Sort Array](https://leetcode.com/problems/relative-sort-array)                                                                             |                                                           [![Java](assets/java.png)](src/RelativeSortArray.java)                                                            |                                                                                                                                   |
 | 1128 | [Number of Equivalent Domino Pairs](https://leetcode.com/problems/number-of-equivalent-domino-pairs)                                                 |                                                     [![Java](assets/java.png)](src/NumberOfEquivalentDominoPairs.java)                                                      |                                                                                                                                   |
 | 1133 | 🔒 [Largest Unique Number](https://leetcode.com/problems/largest-unique-number)                                                                      |                                                                                                                                                                             |                                                                                                                                   |
 | 1134 | 🔒 [Armstrong Number](https://leetcode.com/problems/armstrong-number)                                                                                |                                                                                                                                                                             |                                                                                                                                   |

src/RelativeSortArray.java

@@ -0,0 +1,40 @@
+import java.util.Arrays;
+import java.util.HashMap;
+import java.util.Map;
+
+public class RelativeSortArray {
+    public int[] relativeSortArray(int[] arr1, int[] arr2) {
+        final Map<Integer,Integer> elementWeight = new HashMap<>();
+        for (int i = 0 ; i < arr2.length ; i++) elementWeight.put(arr2[i], i);
+        Integer[] array = arrayFrom(arr1);
+        Arrays.sort(array, (o1, o2) -> {
+            if (elementWeight.containsKey(o1) && elementWeight.containsKey(o2)) {
+                return elementWeight.get(o1) - elementWeight.get(o2);
+            }
+            if (elementWeight.containsKey(o1)) {
+                return -1;
+            }
+            if (elementWeight.containsKey(o2)) {
+                return 1;
+            }
+            return Integer.compare(o1, o2);
+        });
+        return toIntArray(array);
+    }
+
+    private Integer[] arrayFrom(int[] array) {
+        Integer[] result = new Integer[array.length];
+        for (int index = 0 ; index < array.length ; index++) {
+            result[index] = array[index];
+        }
+        return result;
+    }
+
+    private int[] toIntArray(Integer[] array) {
+        int[] result = new int[array.length];
+        for (int index = 0 ; index < array.length ; index++) {
+            result[index] = array[index];
+        }
+        return result;
+    }
+}