Number of 1 Bits

题目链接

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.

Note:
Note that in some languages such as Java, there is no unsigned integer type. In this case, the input will be given as signed integer type and should not affect your implementation, as the internal binary representation of the integer is the same whether it is signed or unsigned.
In Java, the compiler represents the signed integers using 2’s complement notation. Therefore, in Example 3 above the input represents the signed integer -3.

Follow up:
If this function is called many times, how would you optimize it?

题目翻译：

写一个函数，接收参数为无符号整型数据，返回值为参数中1的个数（即汉明距离）。
例如，一个32位的整数11的二进制表示为00000000000000000000000000001011，所以函数返回值应为3。

第一种方法：

解题思路：

该问题解决思路是，首先要将整数转化为二进制，然后再计算1的数量。

python3代码实现：

class Solution(object):
    def hammingWeight(self, n):
        """
        :type n: int
        :rtype: int
        """
        return str(bin(n)).count('1')
        

第二种方法：

解题思路：

我们还可以通过二进制操作来完成，这样效率肯定会提升的。0&1 = 0，1&1=1，因此通过和1做与运算来统计1的个数，然后将这个数每次右移1位。

python3 代码实现：

class Solution(object):
    def hammingWeight(self, n):
        """
        :type n: int
        :rtype: int
        """
        count = 0
        temp = n
        while temp:
            if temp & 1:
                count += 1
            temp = temp >> 1
        return count