LeetCode406. Queue Reconstruction by Height

tigerhuli

于 2019-10-12 13:52:26 发布

阅读量88

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode

本文链接：https://blog.youkuaiyun.com/m0_37518259/article/details/102519148

LeetCode 专栏收录该内容

503 篇文章

订阅专栏

本文介绍了一种用于根据人们在队列中特定条件（高度和前面较高者数量）重构队列的算法。通过先按高度降序排序，再插入到正确位置的方法，实现了高效有序的队列重构。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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]]

参考资料：here。

class Solution {
public:
	vector<vector<int>> reconstructQueue(vector<vector<int>>& people) {
		sort(people.begin(), people.end(), [](vector<int> a, vector<int> b)->bool {return a[0] > b[0] || (a[0] == b[0] && a[1] < b[1]); });
		vector<vector<int>> ans;
		for (vector<int> p : people) {
			ans.insert(ans.begin() + p[1], p);
		}
		return ans;
	}
};