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:
Example 2:
题解:
def find_complement(n):
n_char_list = list(bin(n)[2:])
for i in range(len(n_char_list)):
if n_char_list[i] == '0':
n_char_list[i] = '1'
else:
n_char_list[i] = '0'
return int(''.join(n_char_list), 2)
if __name__ == '__main__':
print(find_complement(5))