Number Complement - LeetCode
class Solution { public: int findComplement(long num) { long long i; for (i = 1; i <= num; i <<= 1) num ^= i; return num; } };