191. Number of 1 Bits 位1的个数 #Bit Manipulation

191. Number of 1 Bits

https://leetcode.com/problems/number-of-1-bits/

Description

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.

Solutions

1. 这题贼简单，一看就有思路，一位一位取出来判断是不是1就行了。怎么取？一开始我使用n%2，但这样，java中就会将无符号数认为有符号数（例3），所以可以直接用循环右移和位运算n&1做到。
2. Integer.bitCount()

Submissions

我的~

public class Solution {
    // you need to treat n as an unsigned value
    public int hammingWeight(int n) {
        int bitnum=0;
        for(int i=0;i<32;i++) {
            if((n&1)==1)
                bitnum++;
            n>>=1;
        }
        return bitnum;
    }
}

不写判断，直接加上：
（以及这里和上题不一样，前缀0可以结束循环了所以可以用while）

public static int hammingWeight(int n) {
	int ones = 0;
    	while(n!=0) {
    		ones = ones + (n & 1);
    		n = n>>>1;//这题用无符号右移比较好：正数右移，高位用0补，负数右移，高位用1补，当负数使用无符号右移时，用0进行部位(自然而然的，就由负数变成了正数了)
    	}
    	return ones;
}

Summary

1. 位运算& | xor对于int来说是32位一起算，并不是只算一位。
2. 和上题一样，也有分治解法：
   https://leetcode.com/problems/number-of-1-bits/discuss/55099/Simple-Java-Solution-Bit-Shifting