Number of 1 Bits

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.

思路

程序员入门101
这里用最小时间复杂度的
就是-1和自己&

代码

class Solution {
public:
    int hammingWeight(uint32_t n) {
        int num=0;
        while(n)
        {
            n = n&(n-1);
            num++;
        }
        return num;
    }
};