Leetcode 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 k;
        while(n){
            if(n&1)
                k++;
            n >>= 1;
        }
        return k;
    }
};