Added maximum ones solution.

jusexton · jusexton · commit 129463399efa · 2025-04-20T22:34:05.000-05:00
diff --git a/README.md b/README.md
@@ -178,6 +178,7 @@ programming challenges completed in other languages.
 - [Reverse Vowels of a String](https://leetcode.com/problems/reverse-vowels-of-a-string)
 - [Minimum Recolors to Get K Consecutive Black Blocks](https://leetcode.com/problems/minimum-recolors-to-get-k-consecutive-black-blocks)
 - [Minimum Operations to Make Array Distinct](https://leetcode.com/problems/minimum-number-of-operations-to-make-elements-in-array-distinct)
+- [Row with Maximum Ones](https://leetcode.com/problems/row-with-maximum-ones/)
 
 #### Medium
 
diff --git a/src/leetcode/maximum_ones.rs b/src/leetcode/maximum_ones.rs
@@ -0,0 +1,29 @@
+pub fn row_and_maximum_ones(matrix: Vec<Vec<i32>>) -> Vec<i32> {
+    let mut result = vec![0, i32::MIN];
+    (0..matrix.len()).for_each(|idx| {
+        let one_count = matrix[idx].iter().filter(|&&i| i == 1).count() as i32;
+        if one_count > result[1] {
+            result[0] = idx as i32;
+            result[1] = one_count;
+        }
+    });
+    result
+}
+
+#[cfg(test)]
+mod tests {
+    use super::*;
+
+    #[test]
+    fn finds_row_with_maximum_ones() {
+        assert_eq!(
+            vec![0, 1],
+            row_and_maximum_ones(vec![vec![0, 1], vec![1, 0]])
+        );
+
+        assert_eq!(
+            vec![1, 2],
+            row_and_maximum_ones(vec![vec![0, 0, 0], vec![0, 1, 1]])
+        );
+    }
+}
diff --git a/src/leetcode/mod.rs b/src/leetcode/mod.rs
@@ -176,3 +176,4 @@ mod xor_subarray;
 mod zero_or_one;
 mod zigzag_conversion;
 mod min_operations;
+mod maximum_ones;
