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]]
思路一:由题不难看出,将数组排序后,题目会简单很多。我们可以自定义一个排序准则,将按h递增排序,h相同则按k递减排序。此时我们可以利用贪心算法,寻找结构的贪心性质。我们从排序后的数组来看,利用一个指针遍历数组,假设指针之前的数组都是已经排序完成的,则剩下的第一个pair在未排序中h最小,
因此,我们pair的位置应该是第k个空位置,因为后续空位置都将由比当前pair 的h大的pair 填充,而非空位置都比当前pair的 h小,第k个空位置为安全地选择。 代码如下:
class Solution {
public:
vector<pair<int, int>> reconstructQueue(vector<pair<int, int>>& people) {
vector<pair<int, int>> res(people.size(),pair<int,int>(INT_MIN,INT_MIN));
auto cmp = [](const pair<int,int<