LeetCode 218. The Skyline Problem

题目地址：

注意：做这道题前建议先做这道题Rectangle Area II - LeetCode
看这篇博客：LeetCode 850. Rectangle Area II

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).

Buildings Skyline Contour
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], …]

这道题目的意思是找天际线，并返回线段的左边的端点

LeetCode 218. The Skyline Problem相关推荐

leetcode 218. The Skyline Problem | 218. 天际线问题（线段树）
题目 https://leetcode-cn.com/problems/the-skyline-problem/ 题解线段树问题,根据左神的思路改编,外加我想到的压缩的 tricks(数字范围太大, ...
LeetCode——218. 天际线问题(The Skyline Problem)[困难]——分析及代码（Java）
LeetCode--218. 天际线问题[The Skyline Problem][困难]--分析及代码[Java] 一.题目二.分析及代码 1. 扫描线 + 优先队列 (1)思路 (2)代码 (3 ...
[LeetCode-JAVA] The Skyline Problem
题目:题目太长了,见链接-- > The Skyline Problem Notes: The number of buildings in any input list is guarante ...
Leetcode:The Skyline Problem
题目大意:太复杂了,不太想翻译.对于一丛相互交错的方形建筑,可以由一个二维数组表示各自的轮廓.求从远处观望时看到的天际线.所谓的天际线就是某一段水平区域上的等高线,其下方或者是建筑,或者是地面.求从左 ...
[Swift]LeetCode218. 天际线问题 | The Skyline Problem
★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★ ➤微信公众号:山青咏芝(shanqingyongzhi) ➤博客园地址:山青咏芝(https://www.cnblog ...
Java实现 LeetCode 218 天际线问题
218. 天际线问题城市的天际线是从远处观看该城市中所有建筑物形成的轮廓的外部轮廓.现在,假设您获得了城市风光照片(图A)上显示的所有建筑物的位置和高度,请编写一个程序以输出由这些建筑物形成的天际线 ...
LeetCode 218. 天际线问题（multiset优先队列）*
文章目录 1. 题目 2. 解题 1. 题目城市的天际线是从远处观看该城市中所有建筑物形成的轮廓的外部轮廓. 现在,假设您获得了城市风光照片(图A)上显示的所有建筑物的位置和高度,请编写一个程序以输 ...
LeetCode 218. 天际线问题（C++）*
思路:优先队列+遍历 1.对于左端点:左端点且高度最高的那个就是左边缘: 2.对于右端点:首先右端点不可能是右边界;如果被删除的右端点是最高的,只有删除最高右端点后,该横坐标处的最高点才会是右边界: ...
LeetCode Water and Jug Problem(巧妙转换为gcd问题)
题意:给出x,y升水壶,问是否可以量出z升水.有三种操作:填满水壶,清空水壶. 从其中一个水壶倒入另一个水壶代码如下: public class Solution {private int gcd( ...

LeetCode 218. The Skyline Problem

LeetCode 218. The Skyline Problem相关推荐

最新文章

热门文章