Write a function that takes an unsigned integer and return the number of '1' bits it has (also known as the Hamming weight).
Example 1:
Input: 00000000000000000000000000001011
Output: 3
Explanation: The input binary string 00000000000000000000000000001011 has a total of three '1' bits.
Example 2:
Input: 00000000000000000000000010000000
Output: 1
Explanation: The input binary string 00000000000000000000000010000000 has a total of one '1' bit.
Example 3:
Input: 11111111111111111111111111111101
Output: 31
Explanation: The input binary string 11111111111111111111111111111101 has a total of thirty one '1' bits.
思路:汉明重量的定义就是转成2进制的字符串中非0的个数,利用位运算符,循环除2即可得到结果
代码如下:
public int HammingWeight(uint n) {
int count = 0;
while (n >= 1)
{
if (n % 2 == 1)
{
count++;
}
n = n >> 1;
}
return count;
}
类似的题目:Hamming Distance