Number Complement LeetCode solution in Rust

1
impl Solution {
2
  pub fn find_complement(num: i32) -> i32 {
3
    let mut n = 1;
4
    while n < num {
5
      n = (n << 1) + 1;
6
    }
7
    n - num
8
  }
9
}