int n;
for ( n = 0; i >0; n++)
{
i &= (i-1);
}
return n;
//maybe its function is to count the number of 1, I don't know the sentence means
解决方案
& is the bitwise AND operation in Java. What this function is doing is counting the number of those operations it take to reach 0.
This function is counting the number of "1's" in a binary representation of a number (a bit of research allowed me to find this). The way this works is it flips the rightmost bit that is 1 on every pass in the loop until the number is zero.
For instance, if we run this function on 100:
1100100 & 1100011 = 1100000 //Flipped the rightmost one bit (100 & 99)
1100000 & 1011111 = 1000000 //Then the next (96 & 95)
1000000 & 0111111 = 0000000 //And finally the last (64 & 63)
So the loop will have executed 3 times, indicating 3 "on" bits in the number 100.