public class Solution {
public int[][] reconstructQueue(int[][] people) {
Arrays.sort(people,new Comparator<int[]>(){
public int compare(int[] a1,int[] a2){
return a1[0]!=a2[0]?a2[0]-a1[0]:a1[1]-a2[1];
}
});
ArrayList<int[]> res=new ArrayList<int[]>();
for(int[] cur:people){
res.add(cur[1], cur);
}
return res.toArray(new int[people.length][]);
}
}
406. Queue Reconstruction by Height
最新推荐文章于 2022-02-12 15:11:13 发布