476. Number Complement(easy)

Easy

58876FavoriteShare

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

Note:

1. The given integer is guaranteed to fit within the range of a 32-bit signed integer.
2. 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.

 

C++:

/*
 * @Autor: SourDumplings
 * @Date: 2019-09-27 13:33:17
 * @Link: https://github.com/SourDumplings/
 * @Email: changzheng300@foxmail.com
 * @Description: https://leetcode.com/problems/number-complement/
 * 
 * 与1做异或就会使得01翻转
 */

class Solution
{
public:
    int findComplement(int num)
    {
        int s = 1;
        int e = 0;
        for (int i = 0; i < 31; i++)
        {
            if ((num & s) != 0)
            {
                e = i;
            }
            s <<= 1;
        }
        unsigned mask = (1U << (e + 1)) - 1;
        return num ^ mask;
    }
};

 Java:

/*
 * @Autor: SourDumplings
 * @Date: 2019-09-27 13:45:57
 * @Link: https://github.com/SourDumplings/
 * @Email: changzheng300@foxmail.com
 * @Description: https://leetcode.com/problems/number-complement/
 */

class Solution
{
    public int findComplement(int num)
    {
        int s = 1;
        int e = 0;
        for (int i = 0; i < 31; i++)
        {
            if ((num & s) != 0)
            {
                e = i;
            }
            s <<= 1;
        }
        int mask = (1 << (e + 1)) - 1;
        return num ^ mask;
    }
}