题目:
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,k)排序,使得h大的在前,h相同时k小的在前。再依次插入一个新的vector,将k作为插入的下标。
代码:
class Solution {
public:
vector<pair<int, int>> reconstructQueue(vector<pair<int, int>>& people) {
sort( people.begin() , people.end() , [](pair<int,int> p1,pair<int,int>p2 )
{ return p1.first > p2.first || ( p1.first == p2.first && p1.second < p2.second );} );
vector<pair<int,int>> temp;
for (auto tp : people) {
temp.insert( temp.begin() + tp.second, tp );
}
return temp;
}
};