Given a positive integer n, find the number of non-negative integers less than or equal to n, whose binary representations do NOT contain consecutive ones.
Example 1:
Input: 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.
Note: 1 <= n <= 109
思路:我们用动态规划来解决这个问题
第一步:得到num的二进制字符串,以及其长度n
第二步:定义a,b两个整型数组,分别用来表示以 1 结尾和以 0 结尾的二级制数的个数,继而我们填充整个a,b数组,a[n-1]+b[n-1]包含了所有不包含连续的1的,长度为n的数的个数。
第三步:很显然,a[n-1]+b[n-1]包含了比num大的数,所以我们要剪掉比num大的数
代码:
class Solution {
public int findIntegers(int num) {
StringBuilder sb=new StringBuilder(Integer.toBinaryString(num)).reverse();
int n=sb.length();
int []a=new int[n];//0结尾
int []b=new int[n];//1结尾
a[0]=1;
b[0]=1;
for(int i=1;i<n;i++){
a[i]=a[i-1]+b[i-1];
b[i]=a[i-1];
}
int ans=a[n-1]+b[n-1];
for(int i=n-2;i>=0;i--){
if(sb.charAt(i)=='0'&&sb.charAt(i+1)=='0'){
ans-=b[i];
}else if(sb.charAt(i)=='1'&&sb.charAt(i+1)=='1'){
break;
}
}
return ans;
}
}