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.
n与n-1进行与操作,会消掉最右边的1。
class Solution {
public:
int hammingWeight(uint32_t n) {
int i=0;
while(n)
{
i++;
n&=(n-1);
}
return i;
}
};