2595 - Number of Even and Odd Bits

problem

You are given a positive integer n.

Let even denote the number of even indices in the binary representation of n with value 1.

Let odd denote the number of odd indices in the binary representation of n with value 1.

Note that bits are indexed from right to left in the binary representation of a number.

Return the array [even, odd].

Example 1:

Example 2:

Constraints:

• 1 <= n <= 1000

submission

impl Solution {
    pub fn even_odd_bit(mut n: i32) -> Vec<i32> {
        vec![(n & 0x5555).count_ones() as i32, (n & 0xAAAA).count_ones() as i32]
    }
}