LeetCode 191 -Number of 1 Bits ( JAVA )

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){
                count = count + (n & 1);
                n = n>>>1;
	        }
	        return count;
    }
}

总结：将要求的值进行位移>>> 如果写成>> 就错误，查完资料还是纳闷， >>>是无符号的位移。