Consecutive Ones in Binary Representation

Bit ManipulationCounting

Given a non-negative integer n, convert it to binary and find the maximum number of consecutive ones in its binary representation. Return this maximum count.

Example 1

Input

[
  5
]

Output

Explanation. The binary representation of 5 is 101, which contains a maximum of 1 consecutive one.

Example 2

Input

[
  15
]

Output

Explanation. The binary representation of 15 is 1111, which contains a maximum of 4 consecutive ones.

Example 3

Input

[
  0
]

Output

Explanation. The binary representation of 0 is 0, and there are no consecutive ones.

Example 4

Input

[
  16
]

Output

Explanation. The binary representation of 16 is 10000, which contains no consecutive ones.

Example 5

Input

[
  6
]

Output

Explanation. The binary representation of 6 is 110, which contains a maximum of 2 consecutive ones.

Follow-up: How would your solution change if the input were a binary string instead of an integer?

Constraints:

The input integer will be a non-negative integer.

Views: 4