Added solution of problem 1582

Author: kurpenok

src/solutions/mod.rs

@@ -336,6 +336,7 @@ pub mod s1560_most_visited_sector_in_a_circular_track;
 pub mod s1566_detect_pattern_of_length_m_repeated_k_or_more_times;
 pub mod s1572_matrix_diagonal_sum;
 pub mod s1576_replace_all_s_to_avoid_consecutive_repeating_characters;
+pub mod s1582_special_positions_in_a_binary_matrix;
 pub mod s1619_mean_of_array_after_removing_some_elements;
 pub mod s1935_maximum_number_of_words_you_can_type;
 pub mod s1957_delete_characters_to_make_fancy_string;

src/solutions/s1582_special_positions_in_a_binary_matrix.rs

@@ -0,0 +1,44 @@
+pub fn num_special(mat: Vec<Vec<i32>>) -> i32 {
+    let mut result: i32 = 0;
+
+    let mut row_sums: Vec<i32> = vec![0; mat.len()];
+    let mut col_sums: Vec<i32> = vec![0; mat[0].len()];
+
+    for i in 0..mat.len() {
+        for j in 0..mat[i].len() {
+            row_sums[i] += mat[i][j];
+            col_sums[j] += mat[i][j];
+        }
+    }
+
+    for i in 0..mat.len() {
+        for j in 0..mat[i].len() {
+            if mat[i][j] == 1 && row_sums[i] == 1 && col_sums[j] == 1 {
+                result += 1;
+            }
+        }
+    }
+
+    result
+}
+
+#[cfg(test)]
+mod test {
+    use super::*;
+
+    #[test]
+    fn test_case_1() {
+        assert_eq!(
+            num_special(vec![vec![1, 0, 0], vec![0, 0, 1], vec![1, 0, 0]]),
+            1
+        );
+    }
+
+    #[test]
+    fn test_case_2() {
+        assert_eq!(
+            num_special(vec![vec![1, 0, 0], vec![0, 1, 0], vec![0, 0, 1]]),
+            3
+        );
+    }
+}