Queue Reconstruction by Height

标签：ber   public   equal   input   nbsp   [1]   new   output   arrays   

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

 1 public class Solution {
 2     public int[][] reconstructQueue(int[][] people) {
 3         Arrays.sort(people, (a, b) -> a[0] != b[0] ? b[0] - a[0] : a[1] - b[1]);
 4         List<int[]> result = new LinkedList<>();
 5         for (int[] p : people) {
 6             result.add(p[1], p);
 7         }
 8         return result.toArray(new int[0][0]);
 9     }
10 }

Queue Reconstruction by Height

标签：ber   public   equal   input   nbsp   [1]   new   output   arrays   

原文地址：http://www.cnblogs.com/amazingzoe/p/6403897.html