Binary Bit Parity

mediumSave

Bit ManipulationMath

Given a non-negative integer n, write a function that returns an array where each element is the parity (even or odd indicator) of each bit from the least significant to the most significant.

Example 1

Input

[
  5
]

Output

[1, 0, 1]

Explanation. Binary representation of 5 is 101. From the least significant to the most significant, the parities are odd, even, odd respectively.

Example 2

Input

[
  7
]

Output

[1, 1, 1]

Explanation. Binary representation of 7 is 111. Each bit has an odd parity.

Example 3

Input

[
  0
]

Output

[0]

Explanation. Binary representation of 0 is 0. It has an even parity.

Example 4

Input

[
  8
]

Output

[0, 0, 0, 1]

Explanation. Binary representation of 8 is 1000. From right to left, parities are even, even, even, odd.

Example 5

Input

[
  14
]

Output

[0, 1, 1, 1]

Explanation. Binary representation of 14 is 1110. From least to most significant, the parities are even, odd, odd, odd respectively.

Follow-up: Can you optimize your solution to avoid checking each bit sequentially?

Constraints:

The number will always be a non-negative integer.

Views: 6