Queue Reconstruction by Height问题及解法
来源:互联网 发布:淘宝怎么传宝贝视频 编辑:程序博客网 时间:2024/05/18 20:31
问题描述:
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.
示例:
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]]
问题分析(这里省事了,直接摘抄英文~):
1.Pick out tallest group of people and sort them in a subarray (S). Since there's no other groups of people taller than them, therefore each guy's index will be just as same as his k value.
2.For 2nd tallest group (and the rest), insert each one of them into (S) by k value. So on and so forth.
过程详见代码:
class Solution {public: vector<pair<int, int>> reconstructQueue(vector<pair<int, int>>& people) { auto com = [](const pair<int, int>& p1, const pair<int, int>& p2){return p1.first > p2.first || (p1.first == p2.first && p1.second < p2.second);};sort(people.begin(), people.end(), com);vector<pair<int, int>> res;for (auto p : people){res.insert(res.begin() + p.second, p);}return res; }};
阅读全文
0 0
- Queue Reconstruction by Height问题及解法
- Queue Reconstruction by Height
- Queue Reconstruction by Height
- Queue Reconstruction by Height
- Queue Reconstruction by Height
- Queue Reconstruction by Height
- Queue Reconstruction by Height
- Queue Reconstruction by Height
- Queue Reconstruction by Height
- Queue Reconstruction by Height
- Queue Reconstruction by Height
- Queue Reconstruction by Height
- Queue Reconstruction by Height
- Queue Reconstruction by Height
- leetcode406. Queue Reconstruction by Height
- 406. Queue Reconstruction by Height
- 406. Queue Reconstruction by Height
- 406. Queue Reconstruction by Height
- Ubuntu"卷boot仅剩0字节的硬盘空间"解决方案
- Spring框架入手学习(四)
- 3629: [JLOI2014]聪明的燕姿
- 类与类的关联、聚集和组合关系
- C. Leha and Function
- Queue Reconstruction by Height问题及解法
- CentOS之Tree显示目录结构-yellowcong
- typedef定义别名
- tarjan
- xutils大全
- lower_bound和upper_bound(STL算法)
- DOM操作--表格的相关操作
- Android开发之通过反射获取到Android隐藏的方法
- opencv3.0 IplImage* 与Mat 格式相互转换