【LeetCode】476. Number Complement【E】【59】

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.

Subscribe to see which companies asked this question.

class Solution(object):
    def findComplement(self, num):

        s = bin(num)[2:]

        res = ''

        for i in s:
            if i == '0':
                res += '1'
            else:
                res += '0'
        return int(res,2)

二进制操作 按位取反 然后转成int