LeetCode-338. 比特位计数

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 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_popcount in c++ or in any other language.

动态规划 与&运算

两个相邻的数做&运算，得到的结果在二进制下，对应位都为1则取1，其余为0.也就是由结果中二进制下的某位变为1，为这两个相邻数中的后者，比如:5&6=4，而6的二进制表示为110，4的二进制表示为100，100第二位变为1便是110，所以就取相邻两数做与运算后对应1的个数加一。语文学的不好，表达的可能不清楚,嘻嘻(^^)

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