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.

题意：给定一个整数num，输出0 到num 之间的整数都有多少个1。

方法一：遍历 0 到 num，分别计算一个数有多少个1。

class Solution {
public:
    int hammingWeight(uint32_t n) {
      int count = 0;
      while(n>0)
      {
          if(n%2 == 1)
          {
              count++;
          }
          n = n>>1 ;
      }
        return count;
    }

    vector<int> countBits(int num) {        
         vector<int> result(num+1, 0);
         for(int i = 1;i< result.size();i++)
         {
             result[i] =hammingWeight(i);
         }
        return result;
    }
};

方法二：初始化一个数组result,大小为num +1 ,初值为0。 采用递推公式result[i] = result[i&(i -1)] +1 。理论依据是i&(i -1)的结果 比 i 少一个1。

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