refactor 1122

fishercoder1534 · fishercoder1534 · commit 3a88d77f973f · 2020-08-11T08:33:11.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_1122.java b/src/main/java/com/fishercoder/solutions/_1122.java
@@ -3,23 +3,6 @@
 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) {
