LeetCode338. Counting Bits

Given a non negative integer number num. For every numbers i in the range 0 ≤ i ≤ numcalculate 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.

参考资料：here。

解决这道题的关键在于观察规律。我们试着写出一些比较特殊的点：

n=0: 0

n=1: 0 1

n=4: 0 1 1 2

n=8: 0 1 1 2 1 2 2 3

...

从上面的点大家可能已经发现规律了：当以2的指数倍增长时，n的前一半就是n/2的值，而后一半就是前一半+1.

class Solution {
public:
	vector<int> countBits(int num) {
		if (num == 0) return vector<int>{0};
		if (num == 1) return vector<int>{0, 1};
		vector<int> ans{ 0,  1};
		for (int i = 1; int(pow(2, i)) <= num; i++) {
			for (int j = 0; j < int(pow(2, i)); j++) {
				ans.push_back(ans[j] + 1);
                if (int(ans.size())-1 == num) break;
			}
            //if (int(ans.size())-1 == num) break;
		}
		return ans;
	}
};