Count Monobit Integers
You are given an integer n.
An integer is called Monobit if all bits in its binary representation are the same.
Return the count of Monobit integers in the range [0, n] (inclusive).
Example 1
Input
n = 1Output
2The integers in the range [0, 1] have binary representations "0" and "1", and each representation consists of identical bits.
Example 2
Input
n = 4Output
3The integers in the range [0, 4] include binaries "0", "1", "10", "11", and "100"; only 0, 1, and 3 satisfy the Monobit condition.
Constraints
- 0 <= n <= 1000