LeetCode 191: Number of 1 Bits

Bit Manipulation LeetCode

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 nums = 0;
    while ( n != 0) {
        nums = nums + (n & 1);
        n = n >> 1;
    }
    return nums;
}