class Solution {
public:
vector<pair<int, int>> reconstructQueue(vector<pair<int, int>>& people) {
vector<pair<int,int>> ret;
sort(people.begin(),people.end(),[](pair<int,int>a,pair<int,int>b){ return a.first>b.first||(a.first==b.first&&a.second<b.second);});
for(auto it:people)
{
ret.insert(it.second+ret.begin(),it);
}
return ret;
}
};
leetcode - 406. Queue Reconstruction by Height
最新推荐文章于 2021-10-08 21:58:08 发布