feat: add solution to lc problem: No.2248 (doocs#805)

chriy · web-flow · commit bd4b0de009c1 · 2022-04-27T21:14:39.000+08:00
No.2248.Intersection of Multiple Arrays
diff --git a/solution/2200-2299/2248.Intersection of Multiple Arrays/README.md b/solution/2200-2299/2248.Intersection of Multiple Arrays/README.md
@@ -57,7 +57,23 @@ nums[0] = [<em><strong>3</strong></em>,1,2,<em><strong>4</strong></em>,5]，nums
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
-
+class Solution {
+    public List<Integer> intersection(int[][] nums) {
+        int[] cnt = new int[1001];
+        for (int[] num : nums) {
+            for (int i : num) {
+                cnt[i]++;
+            }
+        }
+        List<Integer> ans = new ArrayList<>();
+        for (int i = 1; i <= 1000; i++) {
+            if (cnt[i] == nums.length) {
+                ans.add(i);
+            }
+        }
+        return ans;
+    }
+}
 ```
 
 ### **TypeScript**
diff --git a/solution/2200-2299/2248.Intersection of Multiple Arrays/README_EN.md b/solution/2200-2299/2248.Intersection of Multiple Arrays/README_EN.md
@@ -47,7 +47,23 @@ There does not exist any integer present both in nums[0] and nums[1], so we retu
 ### **Java**
 
 ```java
-
+class Solution {
+    public List<Integer> intersection(int[][] nums) {
+        int[] cnt = new int[1001];
+        for (int[] num : nums) {
+            for (int i : num) {
+                cnt[i]++;
+            }
+        }
+        List<Integer> ans = new ArrayList<>();
+        for (int i = 1; i <= 1000; i++) {
+            if (cnt[i] == nums.length) {
+                ans.add(i);
+            }
+        }
+        return ans;
+    }
+}
 ```
 
 ### **TypeScript**
diff --git a/solution/2200-2299/2248.Intersection of Multiple Arrays/Solution.java b/solution/2200-2299/2248.Intersection of Multiple Arrays/Solution.java
@@ -0,0 +1,17 @@
+class Solution {
+    public List<Integer> intersection(int[][] nums) {
+        int[] cnt = new int[1001];
+        for (int[] num : nums) {
+            for (int i : num) {
+                cnt[i]++;
+            }
+        }
+        List<Integer> ans = new ArrayList<>();
+        for (int i = 1; i <= 1000; i++) {
+            if (cnt[i] == nums.length) {
+                ans.add(i);
+            }
+        }
+        return ans;
+    }
+}
