剑指15 二进制位中1的个数

剑指15 二进制位中1的个数

public class Solution {
    // you need to treat n as an unsigned value
    public int hammingWeight(int n) {
        int count = 0;
        while (n != 0) {
            count += (n & 1);
            // 利用java语言中的无符号右移(>>>)
            n = n >>> 1;
        } 
        return count;
    }
}