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 {
    /*
     * 设置一个标志位count
     * 然后将数n的每一个二进制位和1进行&运算，进行一次&运算右移一位，直到所有二进制位都运算完为止
     * 若&运算结果为1，则标志位count自增
     * 返回标志位
     */
    public int hammingWeight(int n) {
        int count = 0;
        for(int i = 0; i < 32; i++){
            if((n & 1) == 1)
                count++;
            n >>>= 1;
        } 
        return count;
    }
}