add skeleton for 1213c

fishercoder1534 · fishercoder1534 · commit 62da8cd135ea · 2019-11-27T15:13:04.000-08:00
diff --git a/src/main/java/com/fishercoder/solutions/_1213.java b/src/main/java/com/fishercoder/solutions/_1213.java
@@ -0,0 +1,27 @@
+package com.fishercoder.solutions;
+
+import java.util.List;
+
+/**
+ * 1213. Intersection of Three Sorted Arrays
+ *
+ * Given three integer arrays arr1, arr2 and arr3 sorted in strictly increasing order,
+ * return a sorted array of only the integers that appeared in all three arrays.
+ *
+ * Example 1:
+ * Input: arr1 = [1,2,3,4,5], arr2 = [1,2,5,7,9], arr3 = [1,3,4,5,8]
+ * Output: [1,5]
+ * Explanation: Only 1 and 5 appeared in the three arrays.
+ *
+ * Constraints:
+ *
+ * 1 <= arr1.length, arr2.length, arr3.length <= 1000
+ * 1 <= arr1[i], arr2[i], arr3[i] <= 2000
+ * */
+public class _1213 {
+    public static class Solution1 {
+        public List<Integer> arraysIntersection(int[] arr1, int[] arr2, int[] arr3) {
+            return null;
+        }
+    }
+}
