https://leetcode.com/problems/counting-bits/
题目出自leetcode,计算含1的位数
编程不熟练太慢了,心累!
问题描述
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.
中文简单描述
给定一个整数num,计算在0
≤
i
≤
num这num+1个数中的有1的位数的统计值,输出结果以向量表示。例如num=5,输出结果应为[0 1 1 2 1 2]
算法要求:线性时间复杂度、o(n)空间内存、不使用builtin function (内置函数,不是很清楚,大概是c++原有的函数的意思吧)
思路
刚开始最先想到的是每个数和1,2,4…分别求与,输出值不为0,说明在对应的位上有1,计数器加1。这样运行的时间复杂度是o(n[
log2n
])。
程序如下:
#include<iostream>
#include<vector>
using namespace std;
class Solution {
public:
vector<int> countBits(int num) {
vector<int> array(num + 1);
vector<int> temp(num + 1);
int n = num;
for (int i = 0;i < num+1;i++)
{
array[i] = 0;
temp[i]=1;
}
while(n>0)
{
for (int i = 0;i < num + 1;i++)
{
if (temp[i] &i)
array[i]++;
temp[i] = temp[i]*2;
}
n = n / 2;
}
return array;
}
};
void main()
{
Solution s;
vector<int> a = s.countBits(5);
for (int i = 0;i < 6;i++)
{
cout << a[i] << endl;
}
}
上面的方法还是挺复杂的。
在讨论区看到一种更好的方法。
思路是这样的:
用到了递归的方法,当前数的1的位数的计数值是当前数和前一个数与值的1位数计数值加1,原理是两个相邻的数的与值的1的位数比大值少1个。(so 神奇!!!)
程序如下:
#include<iostream>
#include<vector>
using namespace std;
class Solution {
public:
vector<int> countBits(int num) {
vector<int> array(num + 1, 0);
for (int i = 1;i < num + 1;i++)
{
array[i] = array[i&(i - 1)] + 1;
}
return array;
}
};
void main()
{
Solution s;
vector<int> a = s.countBits(5);
for (int i = 0;i < 6;i++)
{
cout << a[i] << endl;
}
}