leetcode 600. Non-negative Integers without Consecutive Ones【数位dp】

600. Non-negative Integers without Consecutive Ones【数位dp】

Given a positive integer n, return the number of the integers in the range [0, n] whose binary representations do not contain consecutive ones.

Example 1:

Input: n = 5
Output: 5
Explanation:
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.
Example 2:

Input: n = 1
Output: 2
Example 3:

Input: n = 2
Output: 3

Constraints:

1 <= n <= 109

class Solution {
public:

    int findIntegers(int n) {
        int dp[31];
        int ans=0;

        dp[0]=1;
        dp[1]=1;
        for(int i=2;i<31;i++){
            dp[i]=dp[i-1]+dp[i-2];//dp[x] represnt legal number : length is x, and root is 0 
        }

        int pre=0;
        for(int i=29;i>=0;i--){
            if((n&(1<<i))){
                ans+=dp[i+1];
                
                if(pre==1){
                    break;
                }
                pre=1;
            }else{
                pre=0;
            }
            if(i==0)ans++;
            //cout<<ans<<endl;
        }
        return ans;
    }
};

• 把数想成一棵01字典树
• dp[i]为长度为i，root为0的合法的数的数量
• 有连续的1就退出
• 注意最后把自己加上