LeetCode-The Skyline Problem-解题报告
来源:互联网 发布:大数据时代的信息安全 编辑:程序博客网 时间:2024/06/01 09:39
原链接https://leetcode.com/problems/the-skyline-problem/
A city's skyline is the outer contour of the silhouette formed by all the buildings in that city when viewed from a distance. Now suppose you aregiven the locations and height of all the buildings as shown on a cityscape photo (Figure A), write a program tooutput the skyline formed by these buildings collectively (Figure B).
The geometric information of each building is represented by a triplet of integers[Li, Ri, Hi]
, where Li
and Ri
are the x coordinates of the left and right edge of the ith building, respectively, andHi
is its height. It is guaranteed that 0 ≤ Li, Ri ≤ INT_MAX
,0 < Hi ≤ INT_MAX
, and Ri - Li > 0
. You may assume all buildings are perfect rectangles grounded on an absolutely flat surface at height 0.
For instance, the dimensions of all buildings in Figure A are recorded as:[ [2 9 10], [3 7 15], [5 12 12], [15 20 10], [19 24 8] ]
.
The output is a list of "key points" (red dots in Figure B) in the format of[ [x1,y1], [x2, y2], [x3, y3], ... ]
that uniquely defines a skyline.A key point is the left endpoint of a horizontal line segment. Note that the last key point, where the rightmost building ends, is merely used to mark the termination of the skyline, and always has zero height. Also, the ground in between any two adjacent buildings should be considered part of the skyline contour.
For instance, the skyline in Figure B should be represented as:[ [2 10], [3 15], [7 12], [12 0], [15 10], [20 8], [24, 0] ]
.
Notes:
- The number of buildings in any input list is guaranteed to be in the range
[0, 10000]
. - The input list is already sorted in ascending order by the left x position
Li
. - The output list must be sorted by the x position.
- There must be no consecutive horizontal lines of equal height in the output skyline. For instance,
[...[2 3], [4 5], [7 5], [11 5], [12 7]...]
is not acceptable; the three lines of height 5 should be merged into one in the final output as such:[...[2 3], [4 5], [12 7], ...]
<span style="font-size:14px;">class Solution {public: //参考自 http://www.cnblogs.com/easonliu/p/4531020.html vector<pair<int, int> > getSkyline(vector<vector<int> >& buildings) {typedef pair<int, int>pii;multiset<int> heap;vector<pii> height;vector<pii> ans;for (auto &b : buildings) {height.push_back(pii(b[0], -b[2]));height.push_back(pii(b[1], b[2]));}sort(height.begin(), height.end());heap.insert(0);int pre = 0, cur = 0;for (auto &h : height) {if (h.second < 0) heap.insert(-h.second);else heap.erase(heap.find(h.second));cur = *heap.rbegin();if (cur != pre) {ans.push_back(pii(h.first, cur));pre = cur;}}return ans;}};</span>
- LeetCode-The Skyline Problem-解题报告
- [leetcode] 218. The Skyline Problem 解题报告
- [Leetcode] 218. The Skyline Problem 解题报告
- The Skyline Problem解题报告
- leetcode - The Skyline Problem
- LeetCode - The Skyline Problem
- leetcode:the skyline problem
- The Skyline Problem -- leetcode
- Leetcode -- The Skyline Problem
- The Skyline Problem解题心得
- leetcode 218: The Skyline Problem
- Leetcode 218 The Skyline Problem
- The Skyline Problem Leetcode Java
- leetcode 218: The Skyline Problem
- Leetcode #218 The Skyline Problem
- [leetcode] 218.The Skyline Problem
- [LeetCode 218] The Skyline Problem
- LeetCode 218. The Skyline Problem
- Objective-C 快速入门--基础(四)
- Hibernate也需要呵护——Hibernate的泛型DAO
- 医疗时鲜资讯:谈谈“医学影像诊断&熟人医患关系”
- 使用jquery.uploadify丢失session信息
- poj 2942 圆桌骑士 二分图判定判奇圈,点双连通分量 大白经典题目
- LeetCode-The Skyline Problem-解题报告
- 在Hbase Endpoint Coprocessor中使用coprocessorProxy操作例子与问题解析
- 《Java程序设计》第16周周五:数据库连接 与 随机数的使用&&《Java课程实习》日志(周一)
- 【读书笔记:C++ primer plus 第六版 中文版】第12章 类和动态内存分配
- Qt之QTextCodec乱谈
- C++编程 (二)--- GDB使用指南
- java通信socket实现
- 2015062902 - 为何盗墓等会火呢?
- [深入Python]__new__和__init__