LeetCode-218. The Skyline Problem [C++][Java]

LeetCode-218. The Skyline Problemhttps://leetcode.com/problems/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. Given the locations and heights of all the buildings, return the skyline formed by these buildings collectively.

The geometric information of each building is given in the array buildings where buildings[i] = [lefti, righti, heighti]:

• lefti is the x coordinate of the left edge of the ith building.
• righti is the x coordinate of the right edge of the ith building.
• heighti is the height of the ith building.

You may assume all buildings are perfect rectangles grounded on an absolutely flat surface at height 0.

The skyline should be represented as a list of "key points" sorted by their x-coordinate in the form [[x1,y1],[x2,y2],...]. Each key point is the left endpoint of some horizontal segment in the skyline except the last point in the list, which always has a y-coordinate 0 and is used to mark the skyline's termination where the rightmost building ends. Any ground between the leftmost and rightmost buildings should be part of the skyline's contour.

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

Example 1:

Input: buildings = [[2,9,10],[3,7,15],[5,12,12],[15,20,10],[19,24,8]]
Output: [[2,10],[3,15],[7,12],[12,0],[15,10],[20,8],[24,0]]
Explanation:
Figure A shows the buildings of the input.
Figure B shows the skyline formed by those buildings. The red points in figure B represent the key points in the output list.

Example 2:

Input: buildings = [[0,2,3],[2,5,3]]
Output: [[0,3],[5,0]]

Constraints:

• 1 <= buildings.length <= 10^4
• 0 <= lefti < righti <= 2^31 - 1
• 1 <= heighti <= 2^31 - 1
• buildings is sorted by lefti in non-decreasing order.

 

【C++】

class Solution {
public:
    vector<vector<int>> getSkyline(vector<vector<int>>& buildings) {
        vector<vector<int>> ans;
        priority_queue<pair<int, int>> max_heap; // <高度, 右端>
        int i = 0, len = buildings.size();
        int cur_x, cur_h;
        while (i < len || !max_heap.empty()) {
            if (max_heap.empty() || i < len && buildings[i][0] <= max_heap.top().second) {
                cur_x = buildings[i][0];
                while (i < len && cur_x == buildings[i][0]) {
                    max_heap.emplace(buildings[i][2], buildings[i][1]);
                    ++i;
                }
            } else {
                cur_x = max_heap.top().second;
                while (!max_heap.empty() && cur_x >= max_heap.top().second) {
                    max_heap.pop();
                }
            }
            cur_h = (max_heap.empty()) ? 0 : max_heap.top().first;
            if (ans.empty() || cur_h != ans.back()[1]) {
                ans.push_back({cur_x, cur_h});
            }
        }
        return ans;
    }
};

【Java】

class Solution {
    public List<List<Integer>> getSkyline(int[][] buildings) {
        TreeMap<Integer, Integer> map = new TreeMap<>();
        for (int[] b : buildings) {
            map.put(b[0], 0);
            map.put(b[1], 0);
        }
        // scan from top to bottom
        TreeMap<Integer, Integer> map0 = new TreeMap<>();
        Arrays.sort(buildings, (a, b) -> b[2] - a[2]); // sort by y
        for (int[] b : buildings) {
            // get the range of [x1, x2) with all possible value,
            // note x2 would not contribute to the result
            Map<Integer, Integer> sub = map.subMap(b[0], true, b[1], false); 
            sub.forEach((k, v) -> map0.put(k, b[2])); 
            //remove from the original 
            new HashSet<>(sub.keySet()).forEach(k -> map.remove(k));
        }
        map0.putAll(map); // for those all y = 0
        int cur = -1;
        List<List<Integer>> rst = new ArrayList<>();
        for (Map.Entry<Integer, Integer> entry : map0.entrySet()) {
            int key = entry.getKey();
            int value = entry.getValue();
            if (value != cur) { // the same y will only have 1 point
                rst.add(List.of(key, value));
                cur = value;
            }
        }
        return rst;
    }
}