Solution:
思路:在num二进制的位数内,按位异或求题目要求的码制转换
int findComplement(int num) {
int c = num,i=0,r=num;
while(r){
c = c^(1<<i);
r = r/2;
i++;
}
return c;
}
Solution:
思路:在num二进制的位数内,按位异或求题目要求的码制转换
int findComplement(int num) {
int c = num,i=0,r=num;
while(r){
c = c^(1<<i);
r = r/2;
i++;
}
return c;
}