218. The Skyline Problem
2016-07-13 13:42
218 查看
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 are given the locations and height of all the buildings as shown on a cityscape photo (Figure A), write a program to output the skyline formed by these buildings collectively (Figure B).
The geometric information of each building is represented by a triplet of integers
For instance, the dimensions of all buildings in Figure A are recorded as:
The output is a list of "key points" (red dots in Figure B) in the format of
For instance, the skyline in Figure B should be represented as:
Notes:
The number of buildings in any input list is guaranteed to be in the range
The input list is already sorted in ascending order by the left x position
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,
Hide Tags
Binary Indexed Tree Segment Tree Heap Divide and Conquer
Solution: https://briangordon.github.io/2014/08/the-skyline-problem.html
The geometric information of each building is represented by a triplet of integers
[Li, Ri, Hi], where
Liand
Riare the x coordinates of the left and right edge of the ith building, respectively, and
Hiis 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], ...]
Hide Tags
Binary Indexed Tree Segment Tree Heap Divide and Conquer
Solution: https://briangordon.github.io/2014/08/the-skyline-problem.html
相关文章推荐
- 电子取证工具
- java布局——边界布局
- mysql commit rollback autocommit
- Linux下IP冲突检测程序源码及分析(利用免费arp)
- Python——第三方模块PIL安装失败
- Hadoop第一个样例Wordcount运行笔记
- VMware Tools 10 deployment with VUM
- Toolbar使用
- 【Android】开源库整理
- CodeForces 474D Flowers
- Android 绘图贝塞尔曲线简单使用
- 可重入函数与线程安全的区别与联系
- 排序算法总结
- jenkins和docker 在docker里运行jenkins
- SAP Function ALV 01(样式、排序、筛选、事件)
- 第十三讲:软考中高项13_战略管理、业务流程管理、知识管理
- 做到这些你才算的上是真正牛逼的电商运营
- LightOJ1370 Bi-shoe and Phi-shoe 欧拉函数筛法
- 剑指offer系列-T22栈的压入、弹出序列
- int main(int argc, char* argv[])用法解析