原题目:https://leetcode-cn.com/problems/number-complement/
思路:每一位和1进行异或运算就可以了
代码:
class Solution {
public:
int findComplement(int num) {
long long c = 1;
while(c<=num){
num = num ^ c;
c <<= 1;
}
return num;
}
};