Minimum Cost to Move Chips to The Same Position LeetCode solution in Rust

1
impl Solution {
2
  pub fn min_cost_to_move_chips(position: Vec<i32>) -> i32 {
3
    let odd = position.iter().filter(|&p| p % 2 == 1).count();
4
    std::cmp::min(odd, position.len() - odd) as i32
5
  }
6
}