476. Number Complement.md

class Solution {
public:
    int findComplement(int num) {
        int mask = 1;
        while (mask <= num && mask > 0) {
            num ^= mask;
            mask <<= 1;
        }
        return num;
    }
};