Write a function that takes an unsigned integer and returns the number of '1' bits it has (also known as the Hamming weight).
Example 1:
Input: 11
Output: 3
Explanation: Integer 11 has binary representation 00000000000000000000000000001011
Example 2:
Input: 128 Output: 1
Explanation: Integer 128 has binary representation 00000000000000000000000010000000
注意:n&(n-1)可以将二进制数n的最右边的1变成0.
class Solution {
public:
int hammingWeight(uint32_t n)
{
int count=0;
while(n>0)
{
count++;
n=n&(n-1);
}
return count;
}
};