class Solution {
public:
int findComplement(int num) {
int len = 32;
while(1)
{
int c = num & (1<<(len-1));
if(c)
{
break;
}
len--;
}
int c = 1;
for(int i = 0;i<len;i++)
{
num = num^(1<<i);
}
return num;
}
};