feat: add solutions to lc problem: No.1582

No.1582.Special Positions in a Binary Matrix

Author: yanglbme

solution/1500-1599/1582.Special Positions in a Binary Matrix/README.md

@@ -64,22 +64,116 @@
 
 <!-- 这里可写通用的实现逻辑 -->
 
+**方法一：模拟**
+
+遍历矩阵 `mat`，先统计每一行，每一列中 `1` 的个数，分别记录在 `r` 和 `c` 数组中。
+
+然后再遍历矩阵 `mat`，如果 `mat[i][j] == 1` 且 `row[i] == 1` 且 `col[j] == 1`，则 $(i, j)$ 是特殊位置。
+
+时间复杂度 $O(m\times n)$，空间复杂度 $O(m+n)$。其中 $m$, $n$ 分别是矩阵 `mat` 的行数和列数。
+
 <!-- tabs:start -->
 
 ### **Python3**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def numSpecial(self, mat: List[List[int]]) -> int:
+        m, n = len(mat), len(mat[0])
+        r = [0] * m
+        c = [0] * n
+        for i, row in enumerate(mat):
+            for j, v in enumerate(row):
+                r[i] += v
+                c[j] += v
+        ans = 0
+        for i in range(m):
+            for j in range(n):
+                if mat[i][j] == 1 and r[i] == 1 and c[j] == 1:
+                    ans += 1
+        return ans
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
+class Solution {
+    public int numSpecial(int[][] mat) {
+        int m = mat.length, n = mat[0].length;
+        int[] r = new int[m];
+        int[] c = new int[n];
+        for (int i = 0; i < m; ++i) {
+            for (int j = 0; j < n; ++j) {
+                r[i] += mat[i][j];
+                c[j] += mat[i][j];
+            }
+        }
+        int ans = 0;
+        for (int i = 0; i < m; ++i) {
+            for (int j = 0; j < n; ++j) {
+                if (mat[i][j] == 1 && r[i] == 1 && c[j] == 1) {
+                    ++ans;
+                }
+            }
+        }
+        return ans;
+    }
+}
+```
+
+### **C++**
+
+```cpp
+class Solution {
+public:
+    int numSpecial(vector<vector<int>>& mat) {
+        int m = mat.size(), n = mat[0].size();
+        vector<int> r(m), c(n);
+        for (int i = 0; i < m; ++i) {
+            for (int j = 0; j < n; ++j) {
+                r[i] += mat[i][j];
+                c[j] += mat[i][j];
+            }
+        }
+        int ans = 0;
+        for (int i = 0; i < m; ++i) {
+            for (int j = 0; j < n; ++j) {
+                if (mat[i][j] == 1 && r[i] == 1 && c[j] == 1) {
+                    ++ans;
+                }
+            }
+        }
+        return ans;
+    }
+};
+```
 
+### **Go**
+
+```go
+func numSpecial(mat [][]int) int {
+	m, n := len(mat), len(mat[0])
+	r, c := make([]int, m), make([]int, n)
+	for i, row := range mat {
+		for j, v := range row {
+			r[i] += v
+			c[j] += v
+		}
+	}
+	ans := 0
+	for i, x := range r {
+		for j, y := range c {
+			if mat[i][j] == 1 && x == 1 && y == 1 {
+				ans++
+			}
+		}
+	}
+	return ans
+}
 ```
 
 ### **...**

solution/1500-1599/1582.Special Positions in a Binary Matrix/README_EN.md

@@ -42,13 +42,99 @@
 ### **Python3**
 
 ```python
-
+class Solution:
+    def numSpecial(self, mat: List[List[int]]) -> int:
+        m, n = len(mat), len(mat[0])
+        r = [0] * m
+        c = [0] * n
+        for i, row in enumerate(mat):
+            for j, v in enumerate(row):
+                r[i] += v
+                c[j] += v
+        ans = 0
+        for i in range(m):
+            for j in range(n):
+                if mat[i][j] == 1 and r[i] == 1 and c[j] == 1:
+                    ans += 1
+        return ans
 ```
 
 ### **Java**
 
 ```java
+class Solution {
+    public int numSpecial(int[][] mat) {
+        int m = mat.length, n = mat[0].length;
+        int[] r = new int[m];
+        int[] c = new int[n];
+        for (int i = 0; i < m; ++i) {
+            for (int j = 0; j < n; ++j) {
+                r[i] += mat[i][j];
+                c[j] += mat[i][j];
+            }
+        }
+        int ans = 0;
+        for (int i = 0; i < m; ++i) {
+            for (int j = 0; j < n; ++j) {
+                if (mat[i][j] == 1 && r[i] == 1 && c[j] == 1) {
+                    ++ans;
+                }
+            }
+        }
+        return ans;
+    }
+}
+```
+
+### **C++**
+
+```cpp
+class Solution {
+public:
+    int numSpecial(vector<vector<int>>& mat) {
+        int m = mat.size(), n = mat[0].size();
+        vector<int> r(m), c(n);
+        for (int i = 0; i < m; ++i) {
+            for (int j = 0; j < n; ++j) {
+                r[i] += mat[i][j];
+                c[j] += mat[i][j];
+            }
+        }
+        int ans = 0;
+        for (int i = 0; i < m; ++i) {
+            for (int j = 0; j < n; ++j) {
+                if (mat[i][j] == 1 && r[i] == 1 && c[j] == 1) {
+                    ++ans;
+                }
+            }
+        }
+        return ans;
+    }
+};
+```
 
+### **Go**
+
+```go
+func numSpecial(mat [][]int) int {
+	m, n := len(mat), len(mat[0])
+	r, c := make([]int, m), make([]int, n)
+	for i, row := range mat {
+		for j, v := range row {
+			r[i] += v
+			c[j] += v
+		}
+	}
+	ans := 0
+	for i, x := range r {
+		for j, y := range c {
+			if mat[i][j] == 1 && x == 1 && y == 1 {
+				ans++
+			}
+		}
+	}
+	return ans
+}
 ```
 
 ### **...**

solution/1500-1599/1582.Special Positions in a Binary Matrix/Solution.cpp

@@ -0,0 +1,22 @@
+class Solution {
+public:
+    int numSpecial(vector<vector<int>>& mat) {
+        int m = mat.size(), n = mat[0].size();
+        vector<int> r(m), c(n);
+        for (int i = 0; i < m; ++i) {
+            for (int j = 0; j < n; ++j) {
+                r[i] += mat[i][j];
+                c[j] += mat[i][j];
+            }
+        }
+        int ans = 0;
+        for (int i = 0; i < m; ++i) {
+            for (int j = 0; j < n; ++j) {
+                if (mat[i][j] == 1 && r[i] == 1 && c[j] == 1) {
+                    ++ans;
+                }
+            }
+        }
+        return ans;
+    }
+};

solution/1500-1599/1582.Special Positions in a Binary Matrix/Solution.go

@@ -0,0 +1,19 @@
+func numSpecial(mat [][]int) int {
+	m, n := len(mat), len(mat[0])
+	r, c := make([]int, m), make([]int, n)
+	for i, row := range mat {
+		for j, v := range row {
+			r[i] += v
+			c[j] += v
+		}
+	}
+	ans := 0
+	for i, x := range r {
+		for j, y := range c {
+			if mat[i][j] == 1 && x == 1 && y == 1 {
+				ans++
+			}
+		}
+	}
+	return ans
+}

solution/1500-1599/1582.Special Positions in a Binary Matrix/Solution.java

@@ -1,28 +1,22 @@
 class Solution {
     public int numSpecial(int[][] mat) {
-        int rows = mat.length;
-        int cols = mat[0].length;
-        
-        int[] rows1 = new int[rows];
-        int[] cols1 = new int[cols];
-        for (int i = 0; i < rows; i++) {
-            for (int j = 0; j < cols; j++) {
-                if (mat[i][j] == 1) {
-                    rows1[i]++;
-                    cols1[j]++;
-                }
+        int m = mat.length, n = mat[0].length;
+        int[] r = new int[m];
+        int[] c = new int[n];
+        for (int i = 0; i < m; ++i) {
+            for (int j = 0; j < n; ++j) {
+                r[i] += mat[i][j];
+                c[j] += mat[i][j];
             }
         }
-        
         int ans = 0;
-        for (int i = 0; i < rows; i++) {
-            for (int j = 0; j < cols; j++) {
-                if (mat[i][j] == 1 && rows1[i] == 1 && cols1[j] == 1) {
-                    ans ++;
-                } 
+        for (int i = 0; i < m; ++i) {
+            for (int j = 0; j < n; ++j) {
+                if (mat[i][j] == 1 && r[i] == 1 && c[j] == 1) {
+                    ++ans;
+                }
             }
         }
-        
         return ans;
     }
 }

solution/1500-1599/1582.Special Positions in a Binary Matrix/Solution.py

@@ -0,0 +1,15 @@
+class Solution:
+    def numSpecial(self, mat: List[List[int]]) -> int:
+        m, n = len(mat), len(mat[0])
+        r = [0] * m
+        c = [0] * n
+        for i, row in enumerate(mat):
+            for j, v in enumerate(row):
+                r[i] += v
+                c[j] += v
+        ans = 0
+        for i in range(m):
+            for j in range(n):
+                if mat[i][j] == 1 and r[i] == 1 and c[j] == 1:
+                    ans += 1
+        return ans

solution/CONTEST_README.md

@@ -23,6 +23,14 @@ https://lcpredictor.herokuapp.com
 
 ## 往期竞赛
 
+#### 第 309 场周赛(2022-09-04 10:30, 90 分钟) 参赛人数 7972
+
+- [2399. 检查相同字母间的距离](/solution/2300-2399/2399.Check%20Distances%20Between%20Same%20Letters/README.md)
+- [2400. 恰好移动 k 步到达某一位置的方法数目](/solution/2400-2499/2400.Number%20of%20Ways%20to%20Reach%20a%20Position%20After%20Exactly%20k%20Steps/README.md)
+- [2401. 最长优雅子数组](/solution/2400-2499/2401.Longest%20Nice%20Subarray/README.md)
+- [2402. 会议室 III](/solution/2400-2499/2402.Meeting%20Rooms%20III/README.md)
+
+
 #### 第 86 场双周赛(2022-09-03 22:30, 90 分钟) 参赛人数 4401
 
 - [2395. 和相等的子数组](/solution/2300-2399/2395.Find%20Subarrays%20With%20Equal%20Sum/README.md)

solution/CONTEST_README_EN.md

@@ -25,6 +25,14 @@ Get your rating changes right after the completion of LeetCode contests, https:/
 
 ## Past Contests
 
+#### Weekly Contest 309
+
+- [2399. Check Distances Between Same Letters](/solution/2300-2399/2399.Check%20Distances%20Between%20Same%20Letters/README_EN.md)
+- [2400. Number of Ways to Reach a Position After Exactly k Steps](/solution/2400-2499/2400.Number%20of%20Ways%20to%20Reach%20a%20Position%20After%20Exactly%20k%20Steps/README_EN.md)
+- [2401. Longest Nice Subarray](/solution/2400-2499/2401.Longest%20Nice%20Subarray/README_EN.md)
+- [2402. Meeting Rooms III](/solution/2400-2499/2402.Meeting%20Rooms%20III/README_EN.md)
+
+
 #### Biweekly Contest 86
 
 - [2395. Find Subarrays With Equal Sum](/solution/2300-2399/2395.Find%20Subarrays%20With%20Equal%20Sum/README_EN.md)