因为n&n-1会把低位1抵消掉，所以一直做与运算，直到值为0

public class Solution {
    public int hammingWeight(int n) {
        int ret = 0;
        while (n != 0) {
            n &= n - 1;
            ret++;
        }
        return ret;
    }
}