406. Queue Reconstruction by Height

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

思路：

因为k代表着前面h大于当前people的数量，所以可以先按照h由大到小的顺序排序，如果k相同的时候，按照k由小到大排序。

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

然后将元素按照k的下标插入列表中，如果遇到下标已经有元素了，将原来的元素向后面挪动，以保证前面的所有元素的h大于当前元素的h的数量不变。

例如[6,1]插入时，[7,1]向后挪动一位。

[[7,0], [6,1], [7,1]

public class Solution {
    public int[][] reconstructQueue(int[][] people) {
        	Arrays.sort(people, new Comparator<int[]>() {
		@Override
		        public int compare(int[] o1, int[] o2) {
				return o1[0] != o2[0] ? -o1[0] + o2[0] : o1[1] - o2[1];
			}
		});
		List<int[]> res = new LinkedList<>();
		for (int[] cur : people) {
			res.add(cur[1], cur);
		}
		return res.toArray(new int[people.length][]);
    }
}

LinkedList类是双向列表,列表中的每个节点都包含了对前一个和后一个元素的引用。他的获取速度不及ArrayList，但是随机位置插入和删除速度比ArrayList要快。

add（插入的位置，插入的元素）