The Skyline Problem
来源:互联网 发布:越狱铃声软件 编辑:程序博客网 时间:2024/05/18 03:39
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 [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], ...]
class Solution {public: int binary_search_coordinate(vector<int> &coordinates, int x, int len) { int l = 0, r = len - 1, m; while(l <= r) { m = l + (r - l) / 2; if(coordinates[m] == x) { return m; } else if(coordinates[m] < x) { l = m + 1; } else { r = m - 1; } } return -1; } vector<pair<int, int>> getSkyline(vector<vector<int>>& buildings) { vector<int> coordinates; vector< pair<int, int> > ans; int n = buildings.size(); if(n == 0) { //ans.push_back(make_pair(0, 0)); return ans; } int height[10010]; int max_x = 0;; memset(height, 0, sizeof(height)); for(int i = 0; i < n; ++i) { coordinates.push_back(buildings[i][0]); coordinates.push_back(buildings[i][1]); } sort(coordinates.begin(), coordinates.end()); int m = unique(coordinates.begin(), coordinates.end()) - coordinates.begin(); for(int i = 0; i < n; ++i) { int l = binary_search_coordinate(coordinates, buildings[i][0], m); int r = binary_search_coordinate(coordinates, buildings[i][1], m); max_x = max(max_x, r); for(int j = l; j < r; ++j) { height[j] = max(height[j], buildings[i][2]); } } ans.push_back(make_pair(coordinates[0], height[0])); for(int i = 1; i <= max_x; ++i) { if(height[i] != height[i-1]) { ans.push_back(make_pair(coordinates[i], height[i])); } } return ans; }};
- 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
- The Skyline Problem
- The Skyline Problem
- 单例模式
- matlab绘图函数plot
- hdu 1711 整理下水题
- BZOJ3190 [JLOI2013]赛车(单调栈+半平面交)
- 黑马程序员-堆与栈
- The Skyline Problem
- RS485通讯协议的应用
- 汇编语言基础4
- [leetcode] Construct Binary Tree from Inorder and Postorder Traversal
- C和C++程序员面试秘籍
- MySQL按照汉字拼音字母排序
- 求一个数据结构C语言 关于关键字统计源代码
- 模板-高精度A+B,A-B
- Single Number