count-monobit-integers

java

python3

python

javascript

typescript

csharp

golang

kotlin

swift

rust

ruby

dart

scala

elixir

erlang

racket

bash

mysql

mssql

postgresql

oraclesql

pythondata

Algorithms

You are given an integer <code>n</code>.

An integer is called Monobit if all bits in its binary representation are the same.

Return the count of Monobit integers in the range <code>[0, n]</code> (inclusive).

&nbsp;
Example 1:

<div class="example-block">
Input: n = 1

Output: 2

Explanation:

<ul>
	<li>The integers in the range <code>[0, 1]</code> have binary representations <code>&quot;0&quot;</code> and <code>&quot;1&quot;</code>.</li>
	<li>Each representation consists of identical bits. Thus, the answer is 2.</li>
</ul>
</div>

Example 2:

<div class="example-block">
Input: n = 4

Output: 3

Explanation:

<ul>
	<li>The integers in the range <code>[0, 4]</code> include binaries <code>&quot;0&quot;</code>, <code>&quot;1&quot;</code>, <code>&quot;10&quot;</code>, <code>&quot;11&quot;</code>, and <code>&quot;100&quot;</code>.</li>
	<li>Only 0, 1 and 3 satisfy the Monobit condition. Thus, the answer is 3.</li>
</ul>
</div>

&nbsp;
Constraints:

<ul>
	<li><code>0 &lt;= n &lt;= 1000</code></li>
</ul>