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

public int hammingWeight(int n) {
        int bits = 0;
        int mask = 1;

        for (int i = 0; i < 32; i++) {
            if ((n & mask) != 0) {
                bits++;
            }

            mask <<= 1;
        }

        return bits;
    }

    public int hammingWeight2(int n) {
        int res = 0;

        while (n != 0) {
            res++;
            n = n & (n-1); // 总能将n的最低位1变为0
        }

        return res;
    }