Add problem 3151: Special Array I

Author: EFanZh

src/lib.rs

@@ -2108,6 +2108,7 @@ pub mod problem_3143_maximum_points_inside_the_square;
 pub mod problem_3146_permutation_difference_between_two_strings;
 pub mod problem_3147_taking_maximum_energy_from_the_mystic_dungeon;
 pub mod problem_3148_maximum_difference_score_in_a_grid;
+pub mod problem_3151_special_array_i;
 pub mod problem_3350_adjacent_increasing_subarrays_detection_ii;
 
 #[cfg(test)]

src/problem_3151_special_array_i/iterative.rs

@@ -0,0 +1,35 @@
+pub struct Solution;
+
+// ------------------------------------------------------ snip ------------------------------------------------------ //
+
+impl Solution {
+    pub fn is_array_special(nums: Vec<i32>) -> bool {
+        let mut iter = nums.iter().copied();
+
+        iter.next().is_none_or(|mut prev| {
+            iter.all(|num| {
+                let result = (num ^ prev) & 1 != 0;
+
+                prev = num;
+
+                result
+            })
+        })
+    }
+}
+
+// ------------------------------------------------------ snip ------------------------------------------------------ //
+
+impl super::Solution for Solution {
+    fn is_array_special(nums: Vec<i32>) -> bool {
+        Self::is_array_special(nums)
+    }
+}
+
+#[cfg(test)]
+mod tests {
+    #[test]
+    fn test_solution() {
+        super::super::tests::run::<super::Solution>();
+    }
+}

src/problem_3151_special_array_i/mod.rs

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