add 2248

fishercoder1534 · fishercoder1534 · commit a38af6253049 · 2022-04-24T07:59:23.000-07:00
diff --git a/README.md b/README.md
@@ -8,6 +8,7 @@ _If you like this project, please leave me a star._ &#9733;
 
 | #    |      Title     | Solutions                                                                                                                                | Video                                                                         | Difficulty  | Tag                  
 |------|----------------|------------------------------------------------------------------------------------------------------------------------------------------|-------------------------------------------------------------------------------|-------------|-------------
+| 2248 |[Intersection of Multiple Arrays](https://leetcode.com/problems/intersection-of-multiple-arrays/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2248.java)                                                                     || Easy                                                                          ||
 | 2244 |[Minimum Rounds to Complete All Tasks](https://leetcode.com/problems/minimum-rounds-to-complete-all-tasks/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2244.java)                                                                     || Medium                                                                        ||
 | 2243 |[Calculate Digit Sum of a String](https://leetcode.com/problems/calculate-digit-sum-of-a-string/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2243.java)                                                                     || Easy                                                                          ||
 | 2220 |[Minimum Bit Flips to Convert Number](https://leetcode.com/problems/minimum-bit-flips-to-convert-number/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2220.java)                                                                     || Easy                                                                          ||
diff --git a/src/main/java/com/fishercoder/solutions/_2248.java b/src/main/java/com/fishercoder/solutions/_2248.java
@@ -0,0 +1,37 @@
+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;
+
+public class _2248 {
+    public static class Solution1 {
+        public List<Integer> intersection(int[][] nums) {
+            int[] inter = nums[0];
+            for (int i = 0; i < nums.length; i++) {
+                inter = intersection(nums[i], inter);
+            }
+            Arrays.sort(inter);
+            List<Integer> list = new ArrayList<>();
+            for (int i = 0; i < inter.length; i++) {
+                list.add(inter[i]);
+            }
+            return list;
+        }
+
+        public int[] intersection(int[] nums1, int[] nums2) {
+            Set<Integer> set1 = Arrays.stream(nums1).boxed().collect(Collectors.toSet());
+            Set<Integer> set2 = Arrays.stream(nums2).boxed().collect(Collectors.toSet());
+            set1.retainAll(set2);
+            int[] intersection = new int[set1.size()];
+            int i = 0;
+            for (int num : set1) {
+                intersection[i++] = num;
+            }
+            return intersection;
+        }
+
+    }
+}
