【LeetCode 406】Queue Reconstruction by Height

最新推荐文章于 2022-07-30 22:49:52 发布

原创最新推荐文章于 2022-07-30 22:49:52 发布 · 112 阅读

0 ·

CC 4.0 BY-SA版权

LeetCode 同时被 2 个专栏收录

295 篇文章

订阅专栏

逻辑思维

48 篇文章

订阅专栏

本文介绍了一种解决特定队列重构问题的算法。该算法首先根据人的高度和前面更高或同样高的人数对人群进行排序，然后根据每个人前面应该有的人数调整队列位置，最终得到正确重构的队列。示例输入输出展示了算法的有效性。

题意：

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 {
public:
    vector<vector<int>> reconstructQueue(vector<vector<int>>& people) {
        sort(people.begin(), people.end(), [](vector<int>& a, vector<int>& b) {
            return a[0] > b[0] || (a[0] == b[0] && a[1] < b[1]);
        });
        for (int i = 0; i < people.size(); i++) {
            auto p = people[i];
            if (p[1] != i) {
                people.erase(people.begin() + i);
                people.insert(people.begin() + p[1], p);
            }
        }
        return people;
    }
};