题目描述:
给定一个数字n,统计1~n之间的n个数字的二进制的1的个数
int Nums_Of_Bit_1(int num)
{
int* number = new int[num];
int pow = 1,before =1;
int count = 0;
for(int i=1; i<=num; i++){
if (i == pow){
before = number[i] = 1;
pow <<= 1;
}
else{
number[i] = number[before] + 1;
before += 1;
}
count += number[i];
}