class Solution {
public:
static bool cmp(vector<int>& a, vector<int>& b)
{
if(a[0] != b[0]) return a[0] > b[0];
else return a[1] < b[1];
}
vector<vector<int>> reconstructQueue(vector<vector<int>>& people)
{
sort(people.begin(), people.end(), cmp);
vector<vector<int>> result;
for(const vector<int>& it : people)
{
result.insert(result.begin() + it[1], it);
}
return result;
}
};
406. 根据身高重建队列
最新推荐文章于 2024-10-16 19:20:14 发布