LeetCode : 191. Number of 1 Bits

[congr]

https://leetcode.com/problems/number-of-1-bits/

[congr]

public class Solution {
    // you need to treat n as an unsigned value
    public int hammingWeight(int n) {
        // return Integer.bitCount(n);

        int cnt = 0;
        int mask = 1;

        // System.out.println(Integer.toBinaryString(n));
        // System.out.println(Integer.toBinaryString(mask));
        for (int i = 0; i<32; i++) {
            // System.out.println("n & mask = "+ Integer.toBinaryString((n & mask)));
            if ((n & mask) != 0) cnt++;
            mask <<= 1;
        }

        return cnt;
    }
}

[congr]

[congr]