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 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], ...]

 

思路：

比较经典的一道老题，天际线问题。给定一系列数组，每个数组中包含左顶点，右顶点和高度，配合x轴组成一个矩形。找出每个高度变化的横坐标和高度的点。比如x=1时最高高度是3，x=2时最高高度是5，那么就要记录下[2,5]，如果x=2时最高高度是1，记录下[2,1]，只要变化了就记录，不管高低。考虑到矩形有重叠情况，如果同一个横坐标重叠，取高度最高的点。这题比较明显的扫描线法，扫描的是横坐标，需要记录高度。原本需要两个hash map来分别存储矩形的start points和end points，但是因为这里矩形重叠，因此采用unordered_multimap，它能够接受多个相同key同时存在。同时再用一个set来记录x轴的点，因为这个是要被扫描线扫描的目标，所以重复无所谓，只要每个关键点存在即可。之后再用一个map来存储当前高度的数量，这里首先用map是因为每次我们要得出最高高度，需要排序，但是如果单用最大堆就不能快速剔除已经失效的高度，所以要用map；其次map存储的key是高度，value是这个高度出现的次数，即有多少个矩形在这个高度重合，如果在剔除无效高度时，这个高度的value为0，则可以直接在map中删除它。另外还需要一个int来记录每一轮的高度。接下来就是扫描set中的每个点，如果是矩形开始的点，则循环将矩形的高度加入map，这里因为最开始记录坐标和高度的是unordered_multimap，我们采用while循环，中间记录+删除+重新find，来确保当前点的所有矩形开始点都被记录下来。同样的对于矩形结束点也是用while来循环查找以及记录，就是结束点的循环多一步要记得如果当前高度的数量为0要删除这个高度。最后将当前map中最高高度与上一轮高度比较，如果有了变化就记录下来，更新当前高度。

 

代码：

class Solution {
public:
    vector<vector<int>> getSkyline(vector<vector<int>>& buildings) {
        unordered_multimap<int,int> in, out;
        set<int> axis;
        for(auto &b:buildings)
        {
            in.insert({b[0],b[2]});
            out.insert({b[1],b[2]});
            axis.insert(b[0]);
            axis.insert(b[1]);
        }
        vector<vector<int>> res;
        int cur=0;
        map<int,int> height;
        for(auto t:axis)
        {
            // deal with in
            auto itr=in.find(t);
            while(itr!=in.end())
            {
                height[itr->second]++;
                in.erase(itr);
                itr=in.find(t);
            }
            itr=out.find(t);
            while(itr!=out.end())
            {
                height[itr->second]--;
                if(height[itr->second]==0)
                    height.erase(itr->second);
                out.erase(itr);
                itr=out.find(t);
            }
            int temp=height.size()?height.rbegin()->first:0;
            if(temp!=cur)
                res.push_back({t,temp});
            cur=temp;
        }
        return res;
    }
};