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.
191. 二进制中1的个数
返回一个无符号数的二进制中1的个数。
比如:32位的正数11
的二进制为00000000000000000000000000001011
, 所以应该返回3
.
思路
x-1 & x
这样的操作能够去掉最低位的1。连续做这样的操作,直到x为0,即可统计出1的个数。
代码
class Solution {
public:
int hammingWeight(uint32_t n) {
int count = 0;
while(n){
n &= n-1;
count ++;
}
return count;
}
};