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.
首先,他说的是unsigned int;如果不是,那就另当别论。
(1)右移运算
class Solution {
public:
int hammingWeight(uint32_t n) {
int count = 0;
while(n)
{
count += n & 0x01;
n >>= 1;
}
return count;
}
};
上述代码时间复杂度是O(lgn)。
(2)减一运算这种方法是找规律,减一与原数作&,那么得到的数字中二进制的数目会减一,下面是代码:
class Solution {
public:
int hammingWeight(uint32_t n) {
int count = 0;
while(n)
{
n &= (n-1);
count ++;
}
return count;
}
};
这样,程序快了一大截,时间复杂度是1的个数O(M)。