LeetCode 刷题笔记之 排高度

题目如下：

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]]

解答如下：

class Solution {
    public int[][] reconstructQueue(int[][] people) {
         Arrays.sort(people,new Comparator<int[]>(){//先按高度排序，从高到低，相同身高的人k值大的排在前面
           public int compare(int[] p1, int[] p2){
               return p1[0]!=p2[0]?Integer.compare(p2[0],p1[0]): Integer.compare(p1[1],p2[1]);
           }
        });
        List<int[]> list = new LinkedList();
        for (int[] ppl: people) list.add(ppl[1], ppl);//然后按照k的位置去插入元素。因为先插的高，k的大小正好是比他高的人数
        return list.toArray(new int[people.length][] );
    }
}