406. Queue Reconstruction by Height
by Queue height
2023-09-11 14:22:45 时间
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]]
Approach #1: C++.
class Solution { public: vector<pair<int, int>> reconstructQueue(vector<pair<int, int>>& people) { int size = people.size(); vector<pair<int, int>> ans(size, {-1, -1}); sort(people.begin(), people.end()); for (int i = 0; i < size; ++i) { int h = people[i].first; int k = people[i].second; int temp = -1; for (int j = 0; j < size; ++j) { if (ans[j].first == -1 || h == ans[j].first) temp++; if (temp == k) { ans[j] = make_pair(h, k); break; } } } return ans; } };
相关文章
- Leetcode: Queue Reconstruction by Height
- How to find certificates by thumbprint or name with powershell
- Hive-Container killed by YARN for exceeding memory limits. 9.2 GB of 9 GB physical memory used. Consider boosting spark.yarn.executor.memoryOverhead.
- rpm包安装过程中依赖问题“libc.so.6 is needed by XXX”解决方法
- Mysql Order By 字符串排序,mysql 字符串order by
- Solution of NumberOfDiscIntersections by Codility
- MySQL旧版本ORDER BY 方法
- (Step by Step)How to setup IP Phone Server(VoIP Server) for free.
- Javascript面向对象编程(二):构造函数的继承 by 阮一峰
- Spring Remoting by HTTP Invoker Example--reference