【算法】【Greedy】Queue Reconstruction by Height
来源:互联网 发布:淘宝二级页面全屏 编辑:程序博客网 时间:2024/06/16 21:32
Description
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]]
Solution
思路
参考Discuss中高票回答:Easy concept with Python/C++/Java Solution.
设Q
为问题所求队列。
- 从队列里选出最高的人(们)
H
,根据他们的k
值按降序排序。因为队列里其他人都比H
里的人矮(这些人后来插进Q
也不会影响H
里的人的k
值),所以H
里的人的k
值就是他们在Q
中的索引。 - 队列剩余的人重复步骤1.
代码
参照6 lines Concise C++
https://discuss.leetcode.com/topic/60470/6-lines-concise-c
通过leetcode测试。
class Solution {public: vector<pair<int, int>> reconstructQueue(vector<pair<int, int>>& people) { auto comp = [](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(), comp); vector<pair<int, int>> output; for (auto p : people) { output.insert(output.begin() + p.second, p); } return output; }};
阅读全文
0 0
- 【算法】【Greedy】Queue Reconstruction by Height
- 406. Queue Reconstruction by Height | Leecode Greedy
- 406. Queue Reconstruction by Height(greedy)
- Queue Reconstruction by Height(算法分析week8)
- 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
- 八(1) 2
- Android 防止多次点击
- 从零开始学习OpenCL开发(十)深入API
- LeetCode学习(5)Shortest Palindrome(最短回文串)
- centos6.9编译安装httpd2.4(2)
- 【算法】【Greedy】Queue Reconstruction by Height
- linux shell 学习
- vim配置C++ IDE(一)
- 从零开始学电脑 1.2
- JDK源码学习之重写hashCode()和equals()方法
- FCM聚类算法(模糊C均值算法)
- IGV、BWA、Samtool的可视化分析过程。
- vim配置C++ IDE(二)
- [设计]建造者模式