0190 - Reverse Bits

problem

Reverse bits of a given 32 bits signed integer.

Example 1:

Example 2:

Constraints:

• 0 <= n <= 231 - 2
• n is even.

Follow up: If this function is called many times, how would you optimize it?

submission

// let utilize the std
impl Solution {
    pub fn reverse_bits(n: i32) -> i32 {
        n.reverse_bits()
    }
}