Number Complement LeetCode solution in Java

1
class Solution {
2
  public int findComplement(int num) {
3
    int x = 0;
4
    int sum = 0;
5
    while (num > 0) {
6
      int i = num % 2;
7
      if (i == 0) {
8
        sum += Math.pow(2, x++);
9
      } else {
10
        x++;
11
      }
12
      num /= 2;
13
    }
14
    return sum;
15
  }
16
}