LeetCode.338 Counting Bits

338. Counting Bits

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.

计算从0到给定数字num中，所有数字的二进制形式所包含的1的个数。在这里我们将利用&逻辑运算符的特性,即:

1.两个数字进行&运算，得到的结果必将小于这两个数字(若c = a & b, 则有c < a 且 c < b)。

2.c = n & n - 1计算得到的结果中，c二进制形式1的个数比n二进制形式1的个数少一个。

利用以上两个特点，我们就可以从0 & 1开始计算对应数字所包含1的个数。即将计算出的结果对照vector数组查找对应1的个数再加上1就是我们计算n的1的个数了。

具体代码如下:

vector<int> countBits(int num){
	vector<int> result(num + 1, 0);
	for(int i = 1; i <= num; i++){
		result[i] = result[(i & i - 1)] + 1;
	}
	return result;
}