1356. 根据数字二进制下 1 的数目排序
代码:
class Solution {
public int[] sortByBits(int[] arr) {
int[] sort = new int[arr.length];
for (int i = 0; i < arr.length; i++)
{
sort[i] = Integer.bitCount(arr[i]) * 10000 + arr[i];
}
Arrays.sort(sort);
for (int i = 0; i < arr.length; i++) sort[i] = sort[i] % 10000;
return sort;
}
}