题目
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
题解
题目是要给出一个数的二进制表示中1的个数。问题的技巧在于能想到,例如,6的二进制为110,是在2的二进制10前面加上1。也就是,m的二进制是m-2^n的二进制的前面加1, 其中n为满足2^n<m的最大整数。
代码
#include <iostream>
#include <vector>
using namespace std;
class Solution {
public:
vector<int> countBits(int num) {
vector<int> count;
count.push_back(0);
count.push_back(1);
long long exp = 1;
for(int i = 2; i <= num; i++){
if(i % 2 == 0){
exp = 2 * exp;
}
count.push_back(count[i - exp] + 1);
}
return count;
}
};