leetcode-patterns-java/LeetCode_Problems/Java/easy/0476. Number Complement.java at main · elchibek5/leetcode-patterns-java · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
class Solution {
    public int findComplement(int num) {
        if (num == 0) {
            return 1;
        }

        int bitLength = Integer.toBinaryString(num).length();

        int mask = (1 << bitLength) - 1;

        return num ^ mask;
    }
}