[Leetcode 191, Easy] Number of 1 Bits

Problem:

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.

Analysis:

Solution:

C++:

int hammingWeight(uint32_t n) {
        int num = 0;
        for(; n > 0; n /= 2)
            num += (n % 2);
        return num;
    }

Java:

Python: