LeetCode Number of 1 Bits

Number of 1 Bits Total Accepted: 10567 Total Submissions: 28552 My Submissions Question Solution

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 count=0;

while(n&-n)

{

n-=(n&-n);

count++;

}

return count;

}

};

查看原文