leetcode191 Number of 1 Bit

Test instructions: An int is a positive integer that asks how many of its binary forms are 1

Ideas: In addition to 2 recursion, you can solve, see discuss inside there is a solution more cattle, a line to end the fight, is to use n& (n-1) again recursion, in fact, is not very understand how to do so, may be their own treatment of the binary system does not know it, but the result is right

Code:

int Hammingweight (uint32_t N) {    if0)        return0;     if 2 1 )        return1 + hammingweight (n/2);     Else         return hammingweight (n/2);}

The great God code is like this:

int Hammingweight (uint32_t N) {    return0011));}

leetcode191 Number of 1 Bit