476. Number Complement

https://leetcode-cn.com/problems/number-complement/description/
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.

思路,用11111…的二进制减去num即可,关键是求出num有几位.

class Solution {
public:
    int findComplement(int num) {
        int bit = 1;
        int temp = num;
        while (num/2 != 0) {
            num /= 2;
            bit += 1;
        }
        return pow(2, bit)-1 - temp;
    }
};

py:

class Solution:
    def findComplement(self, num):
        """
        :type num: int
        :rtype: int
        """
        digits = 0
        tmp = num
        while tmp > 0:
            digits += 1
            tmp >>= 1
        return 2**digits - 1 - num