卖萌的弱渣

I am stupid, I am hungry.

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

Solution

(Queue-Reconstruction-by-Height.java) download
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16

public class Solution {
    public int[][] reconstructQueue(int[][] people) {
        // override compare
        Arrays.sort(people, new Comparator<int[]>(){
            public int compare(int[] o1, int[] o2)
                {
                    return o1[0]!=o2[0]? o2[0]-o1[0]: o2[1]-o1[1];
                }
            });

            List<int[]> ret = new LinkedList<>();
            for(int[] cur: people)
                ret.add(cur[1], cur);
            return ret.toArray(new int[people.length][]);
    }
}