2017-09-12 LeetCode_218 The Skyline Problem
来源:互联网 发布:男士私处清洁 知乎 编辑:程序博客网 时间:2024/05/29 04:00
218. 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 to output 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, and Hi
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], ...]
Credits:
Special thanks to @stellari for adding this problem, creating these two awesome images and all test cases.
Solution:
- 2017-09-12 LeetCode_218 The Skyline Problem
- leetcode_218. The Skyline Problem ? 待解决
- 105 - The Skyline Problem
- leetcode - The Skyline Problem
- The Skyline Problem
- The Skyline Problem
- The Skyline Problem
- LeetCode - The Skyline Problem
- leetcode:the skyline problem
- LeetCode218:The Skyline Problem
- The Skyline Problem -- leetcode
- Leetcode -- The Skyline Problem
- 218 .The Skyline Problem
- The Skyline Problem
- The Skyline Problem
- The Skyline Problem
- The Skyline Problem
- The Skyline Problem
- python3暴力删除html中gbk不可编码字符
- 别人的关注点
- c++标准库的算法与数据分离效应的副作用
- go函数(方法)返回值是有返回值的函数
- 认识spring容器
- 2017-09-12 LeetCode_218 The Skyline Problem
- Unity3d--实现第三人称视角(相机跟随)
- POJ 2135.Farm Tour 最小费用最大流
- HttpServletRequest cannot be resolved to a type
- [CTF]No.0005 [强网杯] broken
- python中的变量怎样开辟内存
- new MyBlog();
- Ubuntu root 密码忘记-恢复
- prime算法求最小生成图