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.
5ms的代码:
int hammingWeight(uint32_t n) {
int anser = 0;
uint32_t test = 1;
while(test){
anser += (test & n) == 0 ? 0 : 1;
test = test << 1;
}
return anser;
}
4ms的代码:
int hammingWeight(uint32_t n) {
int anser = 0;
while(n){
anser += n%2;
n = n >> 1;
}
return anser;
}
实在想不到更快的了,不知道0ms怎么写。