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.
-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------
题解:
这道题的题意是,给定一个十进制整数n,要求输出从0到n之间每个数字的二进制表示中的1的个数。
最开始的想法就是简单粗暴地写一个计算二进制中有多少个1的函数,然后循环调用这个函数输出结果。虽然这么做是可以的而且在此题中不会超时,但是这么做的复杂度如题所说为O(n*sizeof(integer)),存在更好的O(n)时间复杂度和空间复杂度的算法。既然这道题的标签是动态规划,那么这个最优的算法应该也是用动态规划可以得出,然而我没有想出来,于是看了别人的方法。
在这种动态规划算法中,主要使用的技巧是位与运算。由于一个数i的二进制表示和i-1的二进制表示相与后得到的数正好比i的二进制表示中“1”的个数多1,因此我们可以通过动态规划来完成。
代码:
1.自己写的普通算法
class Solution {
public:
vector<int> countBits(int num) {
vector<int> ans;
for (int i = 0; i <= num; i++)
{
ans.push_back(binary(i));
}
return ans;
}
int binary(int num)
{
int count = 0;
while (num != 0)
{
if (num % 2 != 0)
count++;
num = num / 2;
}
return count;
}
};
2. 动态规划算法
class Solution {
public:
vector<int> countBits(int num) {
vector<int> ret(num+1, 0);
for (int i = 1; i <= num; ++i)
ret[i] = ret[i&(i-1)] + 1;
return ret;
}
};