Pergunta de entrevista da empresa Cisco
How to count number of ones in a binary number
Resposta da entrevista
Sigiloso
14 de abr. de 2015
Using n&(n-1) eliminates least significant '1'. We can write something like this: public static int countOnes(int n){ int count =0; while(n!=0){ n=n&(n-1); count++; } return count; }