leetcode---Queue Reconstruction by Height

最新推荐文章于 2021-07-30 09:29:42 发布

谛听-

最新推荐文章于 2021-07-30 09:29:42 发布

阅读量341

点赞数

CC 4.0 BY-SA版权

分类专栏：题 STL 贪心

本文链接：https://blog.youkuaiyun.com/u012319493/article/details/70941602

题同时被 3 个专栏收录

456 篇文章

订阅专栏

贪心

36 篇文章

订阅专栏

STL

23 篇文章

订阅专栏

本文介绍了一种用于根据人员的高度及前面特定高度的人数来重建队列的算法。该算法首先按特定条件对输入进行排序，然后遍历排序后的列表，将每个元素放置在其正确的位置上。适用于人数少于1,100的情况。

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<pair<int, int>> reconstructQueue(vector<pair<int, int>>& people) 
    {
        sort(people.begin(), people.end(), [](const pair<int, int>& a, const pair<int, int>& b) {
            return (a.first > b.first || (a.first == b.first && a.second < b.second));
        });

        for (int i = 1; i < people.size(); ++i) 
        {
            int cnt = 0;
            for (int k = 0; k < i; k++) 
            {
                if (cnt == people[i].second) 
                {
                    pair<int, int> tmp = people[i];
                    for (int j = i; j > k; j--) 
                    {
                        people[j] = people[j-1];
                    }
                    people[k] = tmp;
                    break;
                }
                if (people[k].first >= people[i].first) 
                    cnt++;
            }
        }
        return people;
    }
};