[LeetCode] 338. Counting Bits

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

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.

分析

通过观察前面几个数0, 1, 10, 11, 100, 101, 110, 111…可以看出对于n和n+1（n为偶数），n的1的个数和n/2相同，而n+1的1的个数比n/2多一个，从二进制来看，n是n/2左移移位得到的结果，因此两个1的个数相同，n+1也因此多一个1，这样形成了一个循环的过程。

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