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?

 

自己的解法：

把n转换为二进制的字符串，然后迭代求出1的个数，时间复杂度O(n)。当然这是非常慢的。

public class Solution {
    // you need to treat n as an unsigned value
    public int hammingWeight(int n) {
        
        char[] res = Integer.toBinaryString(n).toCharArray();
        int r = 0;
        for(int i=0;i<res.length;i++){
            if(res[i]=='1'){
                r++;
            }
        }
        return r;
    }
}

方法二：

Java中的三个用于移位的位运算符：>>、<<、>>>

1. >>是带符号右移，负数高位补1，正数补0

2. <<左移不管负数还是正数，在低位永远补0

3. >>>是不带符号右移，不论负数还是正数，高位补0

public class Solution {
    // you need to treat n as an unsigned value
    public int hammingWeight(int n) {
        
        
        //方法二，无符号位移
        
        int r = 0;
        while(n!=0){
            if(n%2 != 0){
                r++;
            }
            n = n>>>1;
        }
        return r;
    }
}

方法三：

Brian Kernighan方法。当原数不为0时，将原数与上原数减一的与值赋给原数。因为每次减一再相与实际上是将最右边的1给消去了，所以消去几次就有几个1。比如110，减去1得101，相与得100，消去了最右边的1。这里注意的是，当“&”操作的时候，实际上都会转换为二进制去做运算。

public class Solution {
    // you need to treat n as an unsigned value
    public int hammingWeight(int n) {

        //方法三，Brian Kernighan
        
        int r = 0;
        while(n!=0){
            n=n&(n-1);
            r++;
        }
        return r;
    }
}