refactor 350

Author: fishercoder1534

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

@@ -1,9 +1,7 @@
 package com.fishercoder.solutions;
 
-import java.util.ArrayList;
-import java.util.HashMap;
-import java.util.List;
-import java.util.Map;
+import java.util.*;
+
 /**
  * 350. Intersection of Two Arrays II
  *
@@ -40,4 +38,26 @@ public int[] intersect(int[] nums1, int[] nums2) {
             return list.stream().mapToInt(i -> i).toArray();
         }
     }
+
+    public static class Solution2 {
+        public int[] intersect(int[] nums1, int[] nums2) {
+            Arrays.sort(nums1);
+            Arrays.sort(nums2);
+            int i = 0;
+            int j = 0;
+            List<Integer> list = new ArrayList<>();
+            while (i < nums1.length && j < nums2.length) {
+                if (nums1[i] == nums2[j]) {
+                    list.add(nums1[i]);
+                    i++;
+                    j++;
+                } else if (nums1[i] < nums2[j]) {
+                    i++;
+                } else {
+                    j++;
+                }
+            }
+            return list.stream().mapToInt(k -> k).toArray();
+        }
+    }
 }

src/test/java/com/fishercoder/_350Test.java

@@ -0,0 +1,29 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._350;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static org.junit.Assert.assertArrayEquals;
+
+public class _350Test {
+    private static _350.Solution1 solution1;
+    private static _350.Solution2 solution2;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _350.Solution1();
+        solution2 = new _350.Solution2();
+    }
+
+    @Test
+    public void test1() {
+        assertArrayEquals(new int[]{2, 2}, solution1.intersect(new int[]{1, 2, 2, 1}, new int[]{2, 2}));
+    }
+
+    @Test
+    public void test2() {
+        assertArrayEquals(new int[]{2, 2}, solution2.intersect(new int[]{1, 2, 2, 1}, new int[]{2, 2}));
+    }
+
+}