191. Number of 1 Bits(easy)

Easy

475402FavoriteShare

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?

 

C++：

相邻数做与运算：

/*
 * @Author: SourDumplings
 * @Date: 2019-07-31 18:03:39
 * @Link: https://github.com/SourDumplings/
 * @Email: changzheng300@foxmail.com
 * @Description: https://leetcode.com/problems/number-of-1-bits/
 * 
 * 对于数n，和n-1做与运算的话，会使得它的二进制表示中最低位的1变为0。因此统计做几次与运算它变为0即可。
 */

class Solution
{
public:
    int hammingWeight(uint32_t n)
    {
        int res = 0;
        while (n)
        {
            n &= (n - 1);
            ++res;
        }
        return res;
    }
};

蛮力算法：

/*
 * @Author: SourDumplings
 * @Date: 2019-07-31 18:03:39
 * @Link: https://github.com/SourDumplings/
 * @Email: changzheng300@foxmail.com
 * @Description: https://leetcode.com/problems/number-of-1-bits/
 */

class Solution
{
public:
    int hammingWeight(uint32_t n)
    {
        int res = 0;
        uint32_t mask = 1;
        int num = 32;
        while (num--)
        {
            if (n & mask)
            {
                ++res;
            }
            mask <<= 1;
        }
        return res;
    }
};