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.

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;   // i&(i-1)表示从右至左第一个零的左边是1的个数。
        }
        return ret; 
    }
}

题意：返回0~num数字1的个数。

思路：先假设数字sum从右至左第一个0的位置是x，那么sum的数值每增加1.相当于x的数值变成1，而x右端全部变成0.可知

sum&(sum-1)是求取x左端1的个数。即得ret[i&(i-1)]+1是sum的1的个数。