LeetCode Algorithms #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.

思路：

不断移位，然后和1做“与”运算。（也许可以通过其他的“与”运算方法来减少移位运算的次数？）

解：

class Solution {
public:
    int hammingWeight(uint32_t n) {
        int result = 0;
        for(int index = 0; index < 32; index++)
        {
            if(n & 1)
            {
                result++;
            }
            n>>=1;
        }
        return result;
    }
};