Add problem 2980: Check if Bitwise OR Has Trailing Zeros

Author: EFanZh

src/lib.rs

@@ -2036,6 +2036,7 @@ pub mod problem_2966_divide_array_into_arrays_with_max_difference;
 pub mod problem_2970_count_the_number_of_incremovable_subarrays_i;
 pub mod problem_2972_count_the_number_of_incremovable_subarrays_ii;
 pub mod problem_2974_minimum_number_game;
+pub mod problem_2980_check_if_bitwise_or_has_trailing_zeros;
 
 #[cfg(test)]
 mod test_utilities;

src/problem_2980_check_if_bitwise_or_has_trailing_zeros/greedy.rs

@@ -0,0 +1,28 @@
+pub struct Solution;
+
+// ------------------------------------------------------ snip ------------------------------------------------------ //
+
+impl Solution {
+    pub fn has_trailing_zeros(nums: Vec<i32>) -> bool {
+        let mut iter = nums.iter().filter(|&num| num & 1 == 0);
+        let mut found_one = || iter.next().is_some();
+
+        found_one() && found_one()
+    }
+}
+
+// ------------------------------------------------------ snip ------------------------------------------------------ //
+
+impl super::Solution for Solution {
+    fn has_trailing_zeros(nums: Vec<i32>) -> bool {
+        Self::has_trailing_zeros(nums)
+    }
+}
+
+#[cfg(test)]
+mod tests {
+    #[test]
+    fn test_solution() {
+        super::super::tests::run::<super::Solution>();
+    }
+}

src/problem_2980_check_if_bitwise_or_has_trailing_zeros/mod.rs

@@ -0,0 +1,22 @@
+pub mod greedy;
+
+pub trait Solution {
+    fn has_trailing_zeros(nums: Vec<i32>) -> bool;
+}
+
+#[cfg(test)]
+mod tests {
+    use super::Solution;
+
+    pub fn run<S: Solution>() {
+        let test_cases = [
+            (&[1, 2, 3, 4, 5] as &[_], true),
+            (&[2, 4, 8, 16], true),
+            (&[1, 3, 5, 7, 9], false),
+        ];
+
+        for (nums, expected) in test_cases {
+            assert_eq!(S::has_trailing_zeros(nums.to_vec()), expected);
+        }
+    }
+}