题目:
Given a non negative integer number num. For every numbers i in the range 0 ≤ i ≤ num calculate the number of 1's in their binary representation and return them as an array.
Example:
For num = 5
you should return [0,1,1,2,1,2]
.
Follow up:
- It is very easy to come up with a solution with run time O(n*sizeof(integer)). But can you do it in linear time O(n) /possibly in a single pass?
- Space complexity should be O(n).
- Can you do it like a boss? Do it without using any builtin function like __builtin_popcount in c++ or in any other language.
Hint:
- You should make use of what you have produced already.
- Divide the numbers in ranges like [2-3], [4-7], [8-15] and so on. And try to generate new range from previous.
- Or does the odd/even status of the number help you in calculating the number of 1s?
一、暴力解。
/*
for(int i=0;i<=num;++i){
int bit;
for(bit=0;i!=0;i&=i-1) //统计二进制中1的个数
bit++;
res.push_back(bit);
}
*/
二、根据方法一种统计二进制中1的个数的解法,找规律可知res[i]=1+res[i&(i-1)];
for(int i=1;<span style="font-family: Arial, Helvetica, sans-serif;">i<=num;++i</span>){
res.push_back(1+res[i&(i-1)]);
}
三、分段。
【2^(i-1)——2^i-1】为【0——2^(i-1)-1】+1
比如0-1: 0 1
2-3: 1 2
4-7: 1 2 2 3
……