原题:
从右到左,每次都移去最后面的'1'( n &(n-1) ).
代码:
Write a function that takes an unsigned integer and returns the number of ’1' bits it has (also known as theHamming weight).
For example, the 32-bit integer ’11' has binary representation 00000000000000000000000000001011
, so the function should return 3.
从右到左,每次都移去最后面的'1'( n &(n-1) ).
代码:
int hammingWeight(uint32_t n) {
int res=0;
while(n){
++res;
n &=(n-1);
}
return res;
}