程式語言 - LeetCode - C++ - 476. Number Complement



題目:


解答:

class Solution {
public:
    int findComplement(int num) {
        int mask = 1;

        while (mask < num) {
            mask = (mask << 1) | 1;
        }

        return mask ^ num;
    }
};