Counting Bits（Difficulty: Medium）

题目：

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

实现：

 class Solution {
 public:
     vector<int> countBits(int num) {
    vector<int> result;
     for (int i = ; i <= num; i++)
     {
         int count = ;
         int j = i;
         while (j)
         {
             ++count;
             j = (j-) & j;
         }
         result.push_back(count);
     }
     return result;
     }
 };