feat: add solutions to lc problem: No.2248

No.2248.Intersection of Multiple Arrays

Author: yanglbme

solution/2200-2299/2248.Intersection of Multiple Arrays/README.md

@@ -49,7 +49,14 @@ nums[0] = [<em><strong>3</strong></em>,1,2,<em><strong>4</strong></em>,5]，nums
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def intersection(self, nums: List[List[int]]) -> List[int]:
+        cnt = [0] * 1001
+        for num in nums:
+            for v in num:
+                cnt[v] += 1
+        n = len(nums)
+        return [i for i, v in enumerate(cnt) if v == n]
 ```
 
 ### **Java**
@@ -91,6 +98,46 @@ function intersection(nums: number[][]): number[] {
 };
 ```
 
+### **C++**
+
+```cpp
+class Solution {
+public:
+    vector<int> intersection(vector<vector<int>>& nums) {
+        vector<int> cnt(1001);
+        for (auto& num : nums)
+            for (int v : num)
+                ++cnt[v];
+        int n = nums.size();
+        vector<int> ans;
+        for (int i = 1; i < 1001; ++i)
+            if (cnt[i] == n)
+                ans.push_back(i);
+        return ans;
+    }
+};
+```
+
+### **Go**
+
+```go
+func intersection(nums [][]int) []int {
+	cnt := make([]int, 1001)
+	for _, num := range nums {
+		for _, v := range num {
+			cnt[v]++
+		}
+	}
+	var ans []int
+	for i, v := range cnt {
+		if v == len(nums) {
+			ans = append(ans, i)
+		}
+	}
+	return ans
+}
+```
+
 ### **...**
 
 ```

solution/2200-2299/2248.Intersection of Multiple Arrays/README_EN.md

@@ -41,7 +41,14 @@ There does not exist any integer present both in nums[0] and nums[1], so we retu
 ### **Python3**
 
 ```python
-
+class Solution:
+    def intersection(self, nums: List[List[int]]) -> List[int]:
+        cnt = [0] * 1001
+        for num in nums:
+            for v in num:
+                cnt[v] += 1
+        n = len(nums)
+        return [i for i, v in enumerate(cnt) if v == n]
 ```
 
 ### **Java**
@@ -81,6 +88,46 @@ function intersection(nums: number[][]): number[] {
 };
 ```
 
+### **C++**
+
+```cpp
+class Solution {
+public:
+    vector<int> intersection(vector<vector<int>>& nums) {
+        vector<int> cnt(1001);
+        for (auto& num : nums)
+            for (int v : num)
+                ++cnt[v];
+        int n = nums.size();
+        vector<int> ans;
+        for (int i = 1; i < 1001; ++i)
+            if (cnt[i] == n)
+                ans.push_back(i);
+        return ans;
+    }
+};
+```
+
+### **Go**
+
+```go
+func intersection(nums [][]int) []int {
+	cnt := make([]int, 1001)
+	for _, num := range nums {
+		for _, v := range num {
+			cnt[v]++
+		}
+	}
+	var ans []int
+	for i, v := range cnt {
+		if v == len(nums) {
+			ans = append(ans, i)
+		}
+	}
+	return ans
+}
+```
+
 ### **...**
 
 ```

solution/2200-2299/2248.Intersection of Multiple Arrays/Solution.cpp

@@ -0,0 +1,15 @@
+class Solution {
+public:
+    vector<int> intersection(vector<vector<int>>& nums) {
+        vector<int> cnt(1001);
+        for (auto& num : nums)
+            for (int v : num)
+                ++cnt[v];
+        int n = nums.size();
+        vector<int> ans;
+        for (int i = 1; i < 1001; ++i)
+            if (cnt[i] == n)
+                ans.push_back(i);
+        return ans;
+    }
+};

solution/2200-2299/2248.Intersection of Multiple Arrays/Solution.go

@@ -0,0 +1,15 @@
+func intersection(nums [][]int) []int {
+	cnt := make([]int, 1001)
+	for _, num := range nums {
+		for _, v := range num {
+			cnt[v]++
+		}
+	}
+	var ans []int
+	for i, v := range cnt {
+		if v == len(nums) {
+			ans = append(ans, i)
+		}
+	}
+	return ans
+}

solution/2200-2299/2248.Intersection of Multiple Arrays/Solution.py

@@ -0,0 +1,8 @@
+class Solution:
+    def intersection(self, nums: List[List[int]]) -> List[int]:
+        cnt = [0] * 1001
+        for num in nums:
+            for v in num:
+                cnt[v] += 1
+        n = len(nums)
+        return [i for i, v in enumerate(cnt) if v == n]