LeetCode 406. Queue Reconstruction by Height(java)

Suppose you have a random list of people standing in a queue. Each person is described by a pair of integers (h, k), where h is the height of the person and k is the number of people in front of this person who have a height greater than or equal to h. Write an algorithm to reconstruct the queue.

Note:
The number of people is less than 1,100.

Example

Input:
[[7,0], [4,4], [7,1], [5,0], [6,1], [5,2]]

Output:
[[5,0], [7,0], [5,2], [6,1], [4,4], [7,1]]

思路：step1: 将所有数组按h从大到小排序，如果h相同，则k从小到大，step2: 插入答案list,按照从h最大的开始依次往里放，位置即为k的大小，因为先把大的放进result后，再放小的时候，有0个比这个小的大的话，它的位置就是0，有1个比这个小的大的话，它的位置就是1，因为result里的已存在的所有元素都比即将放入的数组大，因此保证了顺序的正确性。编程技巧：这里用到了Arrays. sort()来对二维数组排序和list. toArray(new int[n])方法。

public int[][] reconstructQueue(int[][] people) {
        if (people == null || people.length == 0 || people[0].length == 0) {
            return new int[0][0];
        }
        Arrays.sort(people, new Comparator<int[]>() {
            public int compare(int[] o1, int[] o2) {
                if (o1[0] == o2[0]) return o1[1] - o2[1];
                else return o2[0] - o1[0];
            }
        });
        List<int[]> result = new ArrayList<>();
        for (int[] cur : people) {
            result.add(cur[1], cur);
        }
        int[][] res = result.toArray(new int[people.length][]);
        return res;
    }