第十七周作业:
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 {
public:
vector<pair<int, int>> reconstructQueue(vector<pair<int, int>>& people) {
sort(people.begin(), people.end(),
[](const pair<int, int>& a, pair<int, int>& b) {
return b.first == a.first ? a.second < b.second : b.first < a.first;
});
vector<pair<int, int>> result;
for (const auto& p : people) {
result.emplace(result.begin() + p.second, p);
}
return result;
}
};