JuniorBit Manipulation
Number Complement
The complement of an integer is the integer you get when you flip all the 0's to 1's and all the 1's to 0's in its binary representation.
Given an integer num, return its complement.
Note: This question is the same as 1009: https://leetcode.com/problems/complement-of-base-10-integer/
Example 1
Input
num = 5Output
2The binary representation of 5 is 101 with no leading zero bits, and its complement is 010, which is 2.
Example 2
Input
num = 1Output
0The binary representation of 1 is 1 with no leading zero bits, and its complement is 0.
Constraints
- 1 <= num < 2^31