Java | Leetcode Java题解之第406题根据身高重建队列

题目：

题解：

class Solution {public int[][] reconstructQueue(int[][] people) {Arrays.sort(people, new Comparator<int[]>() {public int compare(int[] person1, int[] person2) {if (person1[0] != person2[0]) {return person2[0] - person1[0];} else {return person1[1] - person2[1];}}});List<int[]> ans = new ArrayList<int[]>();for (int[] person : people) {ans.add(person[1], person);}return ans.toArray(new int[ans.size()][]);}
}