add one solution for 1213

fishercoder1534 · fishercoder1534 · commit aaedbe944adc · 2019-11-28T06:40:40.000-08:00
diff --git a/src/main/java/com/fishercoder/solutions/_1213.java b/src/main/java/com/fishercoder/solutions/_1213.java
@@ -1,6 +1,10 @@
 package com.fishercoder.solutions;
 
+import java.util.ArrayList;
+import java.util.Arrays;
 import java.util.List;
+import java.util.Set;
+import java.util.stream.Collectors;
 
 /**
  * 1213. Intersection of Three Sorted Arrays
@@ -21,7 +25,19 @@
 public class _1213 {
     public static class Solution1 {
         public List<Integer> arraysIntersection(int[] arr1, int[] arr2, int[] arr3) {
-            return null;
+            List<Integer> result = new ArrayList<>();
+            Set<Integer> set2 = Arrays.stream(arr2).boxed().collect(Collectors.toSet());
+            Set<Integer> set3 = Arrays.stream(arr3).boxed().collect(Collectors.toSet());
+            for (int i = 0; i < arr1.length; i++) {
+                if (i >= arr2.length || i >= arr3.length) {
+                    break;
+                } else {
+                    if (set2.contains(arr1[i]) && set3.contains(arr1[i])) {
+                        result.add(arr1[i]);
+                    }
+                }
+            }
+            return result;
         }
     }
 }
diff --git a/src/test/java/com/fishercoder/_1213Test.java b/src/test/java/com/fishercoder/_1213Test.java
@@ -0,0 +1,21 @@
+package com.fishercoder;
+
+import com.fishercoder.common.utils.CommonUtils;
+import com.fishercoder.solutions._1213;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+public class _1213Test {
+    private static _1213.Solution1 solution1;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _1213.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        CommonUtils.printList(solution1.arraysIntersection(new int[]{1, 2, 3, 4, 5}, new int[]{1, 2, 5, 7, 9}, new int[]{1, 3, 4, 5, 8}));
+    }
+
+}
