338 Counting Bits

1 题目

Given a non negative integer number num. For every numbers i in the range 0 ≤ i ≤ numcalculate the number of 1's in their binary representation and return them as an array.

Example 1:

Input: 2
Output: [0,1,1]

Example 2:

Input: 5
Output: [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_popcountin c++ or in any other language.

2 尝试解

2.1 分析

给定范围0~N内的整数，输出每一个整数在二进制下含有数字‘1’的个数，按序排列输出。

0 1 2 3 4 5 6 7 

0 1 1 2 1 2 2 3 

其中F(1) = F(0) + 1

       F(2) = F(1) + 1,F(3) = F(2) + 1

       F(4) = F(0) + 1,F(5) = F(1) + 1, F(6) = F(2) + 1, F(7) = F(3) + 1

即长度为2^(N+1)的序列只需要将长度为2^(N)复制一遍，再将后半部分全部+1即可。

2.2 代码

class Solution {
public:
    vector<int> countBits(int num) {
        vector<int> result{0};
        while(result.size() <= num / 2){
            int size = result.size();
            for(int i =0; i < size; i++){
                result.push_back(result[i]+1);
            }
        }
        for(int i = 0; result.size() < num+1; i++){
            result.push_back(result[i]+1);
        }
        return result;
    }
};

3 标准解

class Solution {
public:
    vector<int> countBits(int num) {
        vector<int> ret(num+1, 0);
        for (int i = 1; i <= num; ++i)
            ret[i] = ret[i&(i-1)] + 1;
        return ret;
    }
};