最快的算法
public static int getBit_1(int num){
int t = 0;
while (num != 0){
num &= (num - 1);
t++;
}
return t;
}
最快的算法
public static int getBit_1(int num){
int t = 0;
while (num != 0){
num &= (num - 1);
t++;
}
return t;
}