<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>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> n = 5
<strong>Output:</strong> 5
<strong>Explanation:</strong>
Here are the non-negative integers &lt;= 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. 
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> n = 1
<strong>Output:</strong> 2
</pre>

<p><strong class="example">Example 3:</strong></p>

<pre>
<strong>Input:</strong> n = 2
<strong>Output:</strong> 3
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= n &lt;= 10<sup>9</sup></code></li>
</ul>

class Solution {
public:
    int findIntegers(int n) {
    int dp[31] = {0};
    dp[0] = 1;
    dp[1] = 2;
    for (int i = 2; i <= 30; i++) {
        dp[i] = dp[i - 1] + dp[i - 2];
    }
    int ans = 0, pre = 0;
    for (int i = 29; i >= 0; i--) {
        if ((n & (1 << i)) != 0) {
            ans += dp[i];
            if (pre == 1) {
                ans--;
                break;
            }
            pre = 1;
        } else {
            pre = 0;
        }
    }
    return ans + 1;
}
};
8100