338. Counting Bits

Question

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.

Credits:

Special thanks to @ syedee for adding this problem and creating all test cases.
Subscribe to see which companies asked this question

这道题是统计二进制数字num内每个数中“1”的个数。以数字“5”为例，包含6个数[0,1,2,3,4,5],对应的包含二进制的数量为[0,1,1,2,2]。

解答：

class Solution{
public:
    vector<int> countBits(int num){

    vector<int> output(num + 1, 0);
    for(int i = 1; i <= num; i++)
        output[i] = output[i>>1] + i % 2;

    return output;