191. 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.

题意：输入一个无符号整数，输出其二进制包含的1的个数。

方法一：整数循环除2，直到为0。在循环中，模2，结果为1时，增加计数。

class Solution {
public:
    int hammingWeight(uint32_t n) {
      int count = 0;
      while(n>0)
      {
          if(n%2 == 1)
          {
              count++;
          }
          n = n/2;
      }
        return count;
    }
};

方法二：整数循环右移一位，直到为0。在循环中，模2，结果为1时，增加计数。

class Solution {
public:
    int hammingWeight(uint32_t n) {
      int count = 0;
      while(n>0)
      {
          if(n%2 == 1)
          {
              count++;
          }
          n = n>>1 ;
      }
        return count;
    }
};

方法二：整数n 循环与n-1 模运算（本质上是去掉最低位的1），更新n = n & (n-1)，增加计数，直到n为0。

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