191 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.

int hammingWeight(uint32_t n) 
{
    int i = 0;
    int count = 0;
    
    while(i<32)
    {
        if( (1<<i) & n )
            count++;
        i++;
    }
    
    return count;
}

600 / 600 test cases passed.	Status:  Accepted
Runtime:  4 ms