【LeetCode】191.Number of 1 Bits

问题：

Write a function that takes an unsigned integer and returns the number of ’1' bits it has (also known as the Hamming weight).

For example, the 32-bit integer ’11' has binary representation 00000000000000000000000000001011, so the function should return 3.

解答：

负数右移会溢出（最高位为符号位，被锁定），必须左移！

代码如下：

public class Solution {
    // you need to treat n as an unsigned value
    public int hammingWeight(int n) {
    	int count = 0;
    	while(n != 0){
    		if((n  & 0x80000000) != 0) count++;
    		n <<= 1;
    	}
    	return count;
    }
}