题目
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的个数
思路
1、逐位相与的方式可计算出。计算次数为32次
2、n &= (n-1);可消除n中最右测的1,不断循环直到n变为0,即可得到1的个数
3、n -= n&(~n+1);原理同方法2相同,只是计算过程不一样,逐次消除最右边的1
方法2、3计算次数只与n的2进制中1的个数有关。
代码
方法1
int hammingWeight(uint32_t n) {
int sum = 0;
while(n){
if(n&1)
sum++;
n >>= 1;
}
return sum;
}
方法2
int hammingWeight(uint32_t n) {
int sum = 0;
while(n){
n &= (n-1);
sum++;
}
return sum;
}
方法3
int hammingWeight(uint32_t n) {
int sum = 0;
while(n){
n -= n&(~n+1);
sum++;
}
return sum;
}