第七周作业:
338. Counting Bits
解题思路:
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到n的十进制数转成二进制后,所含的“1”的个数的数组。最简单的方法当然是逐一计算每个数字的二进制,再算“1”的个数;一个优化的想法是根据十进制转二进制的方法中,统计2^n的个数,就是1的个数,这对于求任意一个数的二进制中1的个数也许是一种好的办法,但是题目既然要求从0到n,那么我们可以通过利用前面已有的结果,再增加一点计算,即可获得下一个。
我们首先观察一下二进制数列的特点:0,1,10,11,100,101,110,111,1000 ......。1的个数是,0,1,1,2,1,2,2,3,1...。我们可以发现,每次二进制增加一个位数的时候,其实增加的1的个数都是前面所有数字的1的个数加1。比如 100,101,110,111的“1”的个数就是0,1,10,11每个都加1。而每次增加位数的10进制数都是2的幂,即1,2,4,8,16,32,64.... .那我们只要到2的幂的时候,从前面已有的值依次加1即是当前值的“1”的个数。我们通过每次乘2的一个temp值来判断下一个2的幂多久之后会达到。
(注:在1和2的时候避免出现问题,在循环外提前实现。)
代码如下:
class Solution {
public:
vector<int> countBits(int num) {
vector<int> result;
result.push_back(0);
if (num >= 1) {
result.push_back(1);
if (num >= 2)
result.push_back(1);
}
int temp = 2, count = 1;
for (int i = 3; i <= num; i++) {
if (count == temp) {
result.push_back(1);
temp *= 2;
count = 1;
} else {
result.push_back(result[i - temp] + 1);
count++;
}
}
return result;
}
};