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]]
思路
參考 http://blog.csdn.net/myfwjy/article/details/52748518?locati
Code
class Solution {
public int[][] reconstructQueue(int[][] people) {
Arrays.sort(people, (new Comparator<int[]>() {
@Override
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[]> array = new LinkedList<>();
for (int[] cur : people) {
// ??
array.add(cur[1], cur);
}
return array.toArray(new int[people.length][]);
}
}
