476. Number Complement.c

/* 
476. Number Complement
Given a positive integer, output its complement number. The complement strategy is to flip the bits of its binary representation.

Note:
The given integer is guaranteed to fit within the range of a 32-bit signed integer.
You could assume no leading zero bit in the integer’s binary representation.
Example 1:
Input: 5
Output: 2
Explanation: The binary representation of 5 is 101 (no leading zero bits), and its complement is 010. So you need to output 2.
Example 2:
Input: 1
Output: 0
Explanation: The binary representation of 1 is 1 (no leading zero bits), and its complement is 0. So you need to output 0.


*/


/*int findComplement(int num) {
    if(num==1) return 0;
    if(num==0) return 1;
    else{
        int x= (log(num)/log(2));
        int y=pow(2,x+1)-1;
        //int t=y-1;
    return num^y;
        
    }
}*/

int findComplement(int num) {
    if(num==1) return 0;
    if(num==0) return 1;
    else{
        int x= (log(num)/log(2));
        int y=pow(2,x+1)-1;
        //int t=y-1;
    return num^y;
        
    }
}