#476

Number Complement

newbie · 280 · lc easy +20 · verified · 70.4% accepted · 3,205 likes · top 79%

play →

Description

The complement of a positive integer is found by flipping all bits in its binary form (no leading zeros). For example, 5 is 101 in binary, so its complement is 010 which equals 2.

Given integer num, return its complement.

Example 1:

Input: num = 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: num = 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.

Code

1
2
3