Class Solution
java.lang.Object
g0501_0600.s0600_non_negative_integers_without_consecutive_ones.Solution
600 - Non-negative Integers without Consecutive Ones.<p>Hard</p>
<p>Given a positive integer <code>n</code>, return the number of the integers in the range <code>[0, n]</code> whose binary representations <strong>do not</strong> contain consecutive ones.</p>
<p><strong>Example 1:</strong></p>
<p><strong>Input:</strong> n = 5</p>
<p><strong>Output:</strong> 5</p>
<p><strong>Explanation:</strong></p>
<pre><code> Here are the non-negative integers <= 5 with their corresponding binary representations:
0 : 0
1 : 1
2 : 10
3 : 11
4 : 100
5 : 101
Among them, only integer 3 disobeys the rule (two consecutive ones) and the other 5 satisfy the rule.
</code></pre>
<p><strong>Example 2:</strong></p>
<p><strong>Input:</strong> n = 1</p>
<p><strong>Output:</strong> 2</p>
<p><strong>Example 3:</strong></p>
<p><strong>Input:</strong> n = 2</p>
<p><strong>Output:</strong> 3</p>
<p><strong>Constraints:</strong></p>
<ul>
<li><code>1 <= n <= 10<sup>9</sup></code></li>
</ul>
-
Constructor Summary
Constructors -
Method Summary
-
Constructor Details
-
Solution
public Solution()
-
-
Method Details
-
findIntegers
public int findIntegers(int n)
-