338. Counting Bits（动态规划）

https://leetcode.com/problems/counting-bits/description/

题目：求0~num中每个数1的个数。

思路：动态规划，方程，v[n]=v[n>>1]+n%2。

class Solution {
public:
    vector<int> countBits(int num) {
      vector<int>v;v.push_back(0);
        for(int x=1;x<=num;x++)
        {
            int temp=v[x>>1]+x%2;
            v.push_back(temp);
        }
        return v;
    }
};