Week Training: 406 Queue Reconstruction by Height

原创于 2017-04-23 09:54:03 发布 · 171 阅读

CC 4.0 BY-SA版权

本文介绍了一种高效的队列重构算法。通过首先按第一个元素降序排序，再按第二个元素升序排序，最后根据排序后的队列中元素的第二个值进行插入操作，实现了快速重构队列的目的。

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

Before, I traverse the vector times and times to find the one to insert into the new vector each time, with a low efficiency. However, I was impressed by another ingenious method and used it without hesitation. We first sort the vector descending first element, then the ascending second element. After that, we just insert each element in the sorted vector based on its second value. An amazing way to solve this problem.

class Solution {
public:
    static bool comp(pair<int, int> a, pair<int, int> b){
        return a.first > b.first || (a.first == b.first && a.second < b.second);
    }
    vector<pair<int, int>> reconstructQueue(vector<pair<int, int>>& people) {
        vector<pair<int, int>> re;
        int size = people.size();
        sort(people.begin(),people.end(),comp);
        for(int i=0;i<people.size();i++){
            re.insert(re.begin()+people[i].second,people[i]);
        }
        return re;
    }
};