[Leetcode] 406. Queue Reconstruction by Height

题目： 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]]
思路：
(一开始考虑的也是排序，但是排序方式没有理清楚，后来参考了一大牛的思路)
首先按照身高排序，身高相同的按位置排序，[ [7,0],[7,1] , [6,1],[5,0],[5,2] [4,4], ]
然后把选择最高的 [[7,0], [7,1]]
之后[6,1]
….
….
这样之后的插入位置都是本身所应该在的位置。

具体代码实现：

public class Solution {
    public int[][] reconstructQueue(int[][] people) {
        int row = people.length;
        if(row == 0 || row == 1){
            return people;
        }
        Arrays.sort(people, new Comparator<int[]>() {
            public int compare(int[] arg0, int[] arg1) {
                if(arg0[0] < arg1[0]){
                    return 1;
                }else if(arg0[0] == arg1[0]){
                    if(arg0[1] > arg1[1]){
                        return 1;
                    }else{
                        return -1;
                    }
                }else{
                    return -1;
                }
            }
        });
        List<int[]> list = new LinkedList<int[]>();
        list.add(people[0]);
        for(int i = 1; i < row; i++){
            list.add(people[i][14], people[i]);
        }

        return list.toArray(new int[row][]);
    }
}

其中要学习的点， 二维数组按某个维度排序的方法
List 转化成 arrays 数组的方法