解题思路
定义排序规则,每个数字按照二进制1的个数进行排序,当个数相等时,按照数字大小进行排序,然后输出排序后数组的前M个字符。
import java.util.Arrays;
public class Solution {
class Data implements Comparable<Data> {
int num;
int one;
@Override
public int compareTo(Data o) {
// TODO Auto-generated method stub
if (this.one > o.one) {
return -1;
} else if (this.one < o.one) {
return 1;
} else {
return this.num > o.num ? -1 : (this.num < o.num ? 1 : 0);
}
}
}
public int numOf1(int n) {
int count = 0;
while (n != 0) {
n &= n - 1;
count++;
}
return count;
}
public int[] fun(int num, int element, int[] streamNum) {
if (streamNum == null || streamNum.length == 0 || num == 0 || element == 0)
return new int[1];
Data[] datas = new Data[num];
for (int i = 0; i < num; i++) {
Data d = new Data();
d.num = streamNum[i];
d.one = numOf1(streamNum[i]);
datas[i] = d;
}
Arrays.sort(datas);
int[] result = new int[element];
for (int i = 0; i < element; i++) {
result[i] = datas[i].num;
}
return result;
}
public static void main(String[] args) {
Solution solution = new Solution();
int[] result = solution.fun(10, 3, new int[] { 1, 2, 4, 8, 16, 32, 64, 128, 256, 512 });
System.out.println(Arrays.toString(result));
}
}