406. Queue Reconstruction by Height

最新推荐文章于 2023-11-18 01:25:37 发布

zsjmfy

最新推荐文章于 2023-11-18 01:25:37 发布

阅读量317

点赞数

分类专栏： leetcode

本文链接：https://blog.youkuaiyun.com/zsjmfy/article/details/67640611

版权

leetcode 专栏收录该内容

149 篇文章

订阅专栏

本文介绍了一种用于根据人员的高度及前面高于或等于其高度的人数来重构队列的算法。该算法首先对输入进行排序，然后按特定顺序插入元素到结果列表中。适用于人数少于1,100的情况。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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

public class Solution {
    public int[][] reconstructQueue(int[][] people) {
        Arrays.sort(people, new Comparator<int[]>(){
            @Override
            public int compare(int[] i1, int[] i2) {
                return i1[0] != i2[0] ? i2[0]-i1[0] : i1[1]-i2[1];
            }
        });
        List<int[]> al = new ArrayList<>();
        for (int[] p : people) al.add(p[1], p);

        return al.toArray(new int [people.length][]);
    }
}