338. Counting Bits
Total Accepted: 4609
Total Submissions: 8391
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]
.
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 timeO(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.
O(n*sizeof(integer))
class Solution {
public:
vector<int> countBits(int num) {
vector<int> vec;
for (int i = 0; i <= num; ++i) {
int j = i, cnt = 0;
while (j) {
if (j&1)
++cnt;
j = j>>1;
}
vec.push_back(cnt);
}
return vec;
}
};
打表之后可以找个规律,得到O(n)的解法:
vector<int> countBits_2(int num) {
vector<int> vec(1, 0);
for (int i = 1; i <= num; i *= 2) {
for (int j = 0; j < i; ++j) {
vec.push_back(vec[j] + 1);
}
}
return vector<int>(vec.begin(), vec.begin() + num + 1);
}