Queue Reconstruction by Height

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

t617

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

阅读量276

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode

本文链接：https://blog.youkuaiyun.com/t6_17/article/details/78259217

LeetCode 专栏收录该内容

13 篇文章

订阅专栏

本文介绍了一种根据人员的高度及前面高于或等于其高度的人数来重构队列的算法。通过定义比较器并对输入进行排序，算法实现了正确重构。示例展示了如何将原始数据转换为有序队列。

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

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

class Solution {
    struct cmp {
        bool operator() (const pair<int,int> &a, const pair<int,int> &b) {
            return a.first<b.first || (a.first==b.first && a.second>b.second);
        }  
    };
    public:
        vector<pair<int, int>> reconstructQueue(vector<pair<int, int>>& people) {
            vector<int> v;
            for(int i=0;i<people.size();i++) v.push_back(i);
            vector<pair<int, int>> res(people.size());
            sort(people.begin(), people.end(), cmp());
            for(auto &a:people) {
                res[v[a.second]] = a;
                v.erase(v.begin()+a.second);
            }
            return res;
        }
};