统计整数转换为二进制数中位1的个数:
int getBitNum(int n)
{
int count = 0;
while (n) {
n = n & (n - 1);
count++;
}
return count;
}
作者:wtffqbpl
链接:https://leetcode-cn.com/problems/sort-integers-by-the-number-of-1-bits/solution/cyu-yan-tong-pai-xu-jie-ti-si-lu-by-wtffqbpl/
来源:力扣(LeetCode)
著作权归作者所有。商业转载请联系作者获得授权,非商业转载请注明出处。