Add problem 3192: Minimum Operations to Make Binary Array Elements Equal to One II

Author: EFanZh

src/lib.rs

@@ -2129,6 +2129,7 @@ pub mod problem_3185_count_pairs_that_form_a_complete_day_ii;
 pub mod problem_3186_maximum_total_damage_with_spell_casting;
 pub mod problem_3190_find_minimum_operations_to_make_all_elements_divisible_by_three;
 pub mod problem_3191_minimum_operations_to_make_binary_array_elements_equal_to_one_i;
+pub mod problem_3192_minimum_operations_to_make_binary_array_elements_equal_to_one_ii;
 pub mod problem_3350_adjacent_increasing_subarrays_detection_ii;
 
 #[cfg(test)]

src/problem_3192_minimum_operations_to_make_binary_array_elements_equal_to_one_ii/greedy.rs

@@ -0,0 +1,35 @@
+pub struct Solution;
+
+// ------------------------------------------------------ snip ------------------------------------------------------ //
+
+impl Solution {
+    pub fn min_operations(nums: Vec<i32>) -> i32 {
+        let mut mask = 0_u32;
+        let mut result = 0;
+
+        for num in nums {
+            if num.cast_unsigned() == mask {
+                mask ^= 1;
+                result += 1;
+            }
+        }
+
+        result
+    }
+}
+
+// ------------------------------------------------------ snip ------------------------------------------------------ //
+
+impl super::Solution for Solution {
+    fn min_operations(nums: Vec<i32>) -> i32 {
+        Self::min_operations(nums)
+    }
+}
+
+#[cfg(test)]
+mod tests {
+    #[test]
+    fn test_solution() {
+        super::super::tests::run::<super::Solution>();
+    }
+}

src/problem_3192_minimum_operations_to_make_binary_array_elements_equal_to_one_ii/mod.rs

@@ -0,0 +1,18 @@
+pub mod greedy;
+
+pub trait Solution {
+    fn min_operations(nums: Vec<i32>) -> i32;
+}
+
+#[cfg(test)]
+mod tests {
+    use super::Solution;
+
+    pub fn run<S: Solution>() {
+        let test_cases = [(&[0, 1, 1, 0, 1] as &[_], 4), (&[1, 0, 0, 0], 1)];
+
+        for (nums, expected) in test_cases {
+            assert_eq!(S::min_operations(nums.to_vec()), expected);
+        }
+    }
+}