public int[][] reconstructQueue(int[][] people) {
Arrays.sort(people, (i1, i2) -> (i1[0] == i2[0] ? i1[1] - i2[1] : i2[0] - i1[0]));
List<int[]> res = new LinkedList<>();
for (int[] p : people) {
res.add(p[1], p);
}
return res.toArray(new int[res.size()][]);
}
406. 根据身高重建队列
最新推荐文章于 2024-03-24 20:00:51 发布