Number of 1 Bits

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.

------------------------- thinking -----------------------
https://leetcode.com/discuss/27703/concise-java-solution-x-%26-x-1

-------------------------- codes ------------------------------
class Solution {
public:
    int hammingWeight(uint32_t n) {
        int count = 0;
        while (n > 0) {
            count += n & 1;
            n = n >> 1;
        }
        return count;
    }
};
---------------------------- codes -----------------------------
public class Solution { // you need to treat n as an unsigned value public int hammingWeight(int n) { int count = 0; while(n != 0){ n = n & (n-1); count++; } return count; } }