The Skyline Problem

题目：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 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], ...]

思路：因为所有的坐标点只有可能是在边界，因此先把左右两边的值存入一个vector，并且要区分是START还是END。然后用一个最大堆来保存当前的高度值，这里用multiset来实现。对于START的点，插入堆。对于END点，删除此点。要注意，用multiset时不要直接用erase删除，他会删除全部相同的值，而我们只要删除一个，因为可能存在重复的高度。每次处理完相同的x坐标后，再根据不同情况更新结果。代码如下：

[cpp]  view plain copy

1. enum Ptype{START=0,END=1};  
2. class Solution {  
3. public:  
4.     class myPoint{  
5.     public:  
6.         int x;  
7.         int ht;  
8.         Ptype type;  
9.         myPoint(int ix,int iht,Ptype itype):x(ix),ht(iht),type(itype){};  
10.     };  
11.       
12.     vector<pair<int, int> > getSkyline(vector<vector<int> >& buildings) {  
13.         vector<pair<int,int> > ret;  
14.         if(buildings.size()==0)  
15.             return ret;  
16.               
17.         multiset<int,greater<int> > maxheap;  
18.         vector<myPoint> points;  
19.         for(auto a:buildings){  
20.             points.push_back(myPoint(a[0],a[2],START));  
21.             points.push_back(myPoint(a[1],a[2],END));  
22.         }  
23.         sort(points.begin(),points.end(),[](myPoint &a,myPoint &b){return a.x<b.x;});  
24.         int pre=points[0].x;  
25.         for(int i=0;i<points.size();){  
26.             while(points[i].x==pre){  
27.                 if(points[i].type==START){  
28.                     maxheap.insert(points[i].ht);  
29.                 }  
30.                 else{  
31.                     auto it=maxheap.find(points[i].ht);  
32.                     maxheap.erase(it);  
33.                 }  
34.                 i++;  
35.             }  
36.             if(ret.empty()){  
37.                 if(maxheap.empty())  
38.                     ret.push_back(make_pair(pre,0));  
39.                 else  
40.                     ret.push_back(make_pair(pre,*maxheap.begin()));  
41.             }  
42.             else{  
43.                 if(maxheap.empty())  
44.                     ret.push_back(make_pair(pre,0));  
45.                 else{  
46.                     if(ret[ret.size()-1].second!=*maxheap.begin())  
47.                     ret.push_back(make_pair(pre,*maxheap.begin()));  
48.                 }  
49.             }  
50.             if(i<points.size())  
51.                 pre=points[i].x;  
52.         }  
53.         return ret;  
54.     }  
55. };