LeetCode 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].

分析：这是一道对于位运算的题目。迭代公式为
$dp[i] = dp[i>>1] + (i\&1)$
比如4(100)，它是由2(10)在末尾添加个0，5(101)是2(10)在末尾添加个1。
代码如下：

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