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.

第一个想法是直接对每一个数num对2取余的结果相加，num／=2，代码如下：

class Solution {
public:
    vector<int> countBits(int num) {
        vector<int> count;
        for(int i = 0; i <= num; i++) {
            count.push_back(getOnes(i));
        }
        return count;
    }
    int getOnes(int num) {
        int ones = 0;
        while (num > 0) {
            ones += num % 2;
            num /=2;
        }
        return ones;
    }
};

但是有效率要求，考虑观察：

每个数num的1的个数，等于它前一个数除去最低位的1的个数+num的最低位

1001 = 100 + 1001%2；

代码如下：

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