338. Counting Bits

Description:

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.

简要题解：

这里用到一个规律：对于大于或等于0的数，i二进制表示中1的个数比i&(i-1)多1个，并且i > i&(i-1)。

这里采用动态规划，第一个子问题c(0) = 0，对于子问题i，c(i) = c(i&(i-1)) + 1。很容易就能求出所要的解。

代码：

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