题目来源:
题目描述:
Write a function that takes an unsigned integer and returns the number of ’1' bits it has (also known as the Hamming weight).
For example, the 32-bit integer ’11' has binary representation 00000000000000000000000000001011
, so the function should return 3.
我的解决方案:
class Solution {
public:
int hammingWeight(uint32_t n) {
uint32_t tmp=1;
int ret=0;
while(tmp)
{
if(tmp&n)
ret++;
tmp=tmp<<1;
}
return ret;
}
};
很简单也很好想的暴力算法,把1挨个移位,然后相与
int hammingWeight(uint32_t n)
{
int res = 0;
while(n)
{
n &= n - 1;
++ res;
}
return res;
}