Add problem 2864: Maximum Odd Binary Number

Author: EFanZh

src/lib.rs

@@ -14,6 +14,7 @@
     clippy::cast_sign_loss,
     clippy::missing_panics_doc,
     clippy::must_use_candidate,
+    clippy::naive_bytecount,
     reason = "unnecessary"
 )]
 
@@ -1994,6 +1995,7 @@ pub mod problem_2849_determine_if_a_cell_is_reachable_at_a_given_time;
 pub mod problem_2855_minimum_right_shifts_to_sort_the_array;
 pub mod problem_2856_minimum_array_length_after_pair_removals;
 pub mod problem_2859_sum_of_values_at_indices_with_k_set_bits;
+pub mod problem_2864_maximum_odd_binary_number;
 
 #[cfg(test)]
 mod test_utilities;

src/problem_2103_rings_and_rods/iterative.rs

@@ -3,7 +3,6 @@ pub struct Solution;
 // ------------------------------------------------------ snip ------------------------------------------------------ //
 
 impl Solution {
-    #[expect(clippy::naive_bytecount, reason = "optimal")]
     pub fn count_points(rings: String) -> i32 {
         let mut iter_2 = rings.bytes();
 

src/problem_2864_maximum_odd_binary_number/greedy.rs

@@ -0,0 +1,34 @@
+pub struct Solution;
+
+// ------------------------------------------------------ snip ------------------------------------------------------ //
+
+impl Solution {
+    pub fn maximum_odd_binary_number(s: String) -> String {
+        let mut s = s.into_bytes();
+        let ones = s.iter().filter(|&&c| c == b'1').count();
+        let (left, right) = s.split_at_mut(ones - 1);
+        let (last, rest) = right.split_last_mut().unwrap();
+
+        left.fill(b'1');
+        rest.fill(b'0');
+        *last = b'1';
+
+        String::from_utf8(s).unwrap()
+    }
+}
+
+// ------------------------------------------------------ snip ------------------------------------------------------ //
+
+impl super::Solution for Solution {
+    fn maximum_odd_binary_number(s: String) -> String {
+        Self::maximum_odd_binary_number(s)
+    }
+}
+
+#[cfg(test)]
+mod tests {
+    #[test]
+    fn test_solution() {
+        super::super::tests::run::<super::Solution>();
+    }
+}

src/problem_2864_maximum_odd_binary_number/mod.rs

@@ -0,0 +1,18 @@
+pub mod greedy;
+
+pub trait Solution {
+    fn maximum_odd_binary_number(s: String) -> String;
+}
+
+#[cfg(test)]
+mod tests {
+    use super::Solution;
+
+    pub fn run<S: Solution>() {
+        let test_cases = [("010", "001"), ("0101", "1001")];
+
+        for (s, expected) in test_cases {
+            assert_eq!(S::maximum_odd_binary_number(s.to_string()), expected);
+        }
+    }
+}