leetcode - 218. The Skyline Problem

Description

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.

Solution

Solved after others' solutions...

Line sweep, add height when it's start, minus height when it's end. Use a heap to store (ending_position, height), and compare every point with the top element at the heap. If the point is at the right of the top element, then pop from the heap.

When current height is positive, push it to the heap.

Print the result when the height of the top element is different from the previous printed result.

Time complexity: o ( n log ⁡ n ) o(n\log n) o(nlogn)

Space complexity: o ( n ) o(n) o(n)

Code

python3 复制代码
class Solution:
    def getSkyline(self, buildings: List[List[int]]) -> List[List[int]]:
        # heap: (height, position)
        heap = [(0, float('inf'))]
        new_buildings = []
        for left, right, height in buildings:
            new_buildings.append((left, height, right))
            new_buildings.append((right, -height, 'doesn\'t matter'))
        new_buildings.sort(key=lambda x: (x[0], -x[1]))
        res = []
        for left, height, right in new_buildings:
            while heap and left >= heap[0][1]:
                heapq.heappop(heap)
            if height > 0:
                heapq.heappush(heap, (-height, right))
            if not res or res[-1][1] != -heap[0][0]:
                res.append([left, -heap[0][0]])
        return res
相关推荐
liulilittle14 分钟前
IP校验和算法:从网络协议到SIMD深度优化
网络·c++·网络协议·tcp/ip·算法·ip·通信
Ribou32 分钟前
Ubuntu 24.04.2安装k8s 1.33.4 配置cilium
linux·ubuntu·kubernetes
tan180°1 小时前
Boost搜索引擎 网络库与前端(4)
linux·网络·c++·搜索引擎
bkspiderx2 小时前
C++经典的数据结构与算法之经典算法思想:贪心算法(Greedy)
数据结构·c++·算法·贪心算法
Mr. Cao code2 小时前
Docker:颠覆传统虚拟化的轻量级革命
linux·运维·ubuntu·docker·容器
抓饼先生2 小时前
Linux control group笔记
linux·笔记·bash
挺6的还3 小时前
25.线程概念和控制(二)
linux
中华小当家呐3 小时前
算法之常见八大排序
数据结构·算法·排序算法
您的通讯录好友3 小时前
conda环境导出
linux·windows·conda
沐怡旸3 小时前
【算法--链表】114.二叉树展开为链表--通俗讲解
算法·面试