题目
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.
解决:
class Solution {
public:
vector<int> countBits(int num) {
vector<int> ret(num + 1, 0);//num+1个0组成的数组
for (int i = 1; i <= num; ++i)
ret[i] = ret[i&(i - 1)] + 1;//得到ret[i]的值,即第i个数二进制含1的个数。
return ret;
}
};
转载自
http://www.cnblogs.com/HellcNQB/p/5361593.html
这是一个很聪明的算法
ret[i] = ret[i&(i - 1)] + 1;
和
ret[i] = ret[i^(i - 1)] + 1;
都进行了验证,单单测验两个都通过,但是当投入系统提交答案,只有&可以成功通过
对于这点我表示很纳闷。
2.28日
修改
经过师傅的提示,找到了错误的原因当使用亦或^来解决这个问题时,存在数组越界的情况,例如:
输入的num=5;
ret[4]=ret[4^(4-1)]+1;
ret[4]=ret[7]+1;
然而并不存在ret[7]这个数,所以提交的时候一定会出现严重的数组越位。^方法出错。