leetcode-218-The Skyline Problem

zem_nezer

于 2019-02-02 13:27:10 发布

阅读量154

点赞数

CC 4.0 BY-SA版权

分类专栏：算法

本文链接：https://blog.youkuaiyun.com/zem_nezer/article/details/86749024

185 篇文章

订阅专栏

本文探讨了基于事件类型的数组排序方法，详细介绍了如何根据不同事件的起点和终点进行分类处理，使用优先队列和哈希映射来跟踪当前最大高度，并在特定条件下将元素插入结果集。特别注意的是，当遇到相同索引时，应遵循特定的排序规则。

Error:
cannot solve it.

sort the array base on event type and its index
handle it with different case:
- when meet start point and its height is higher than current max., insert it to res
- when meet end point and 1) current max. equal to its height, 2) no other pointer’s height in the queue has same height as end point, insert it to res

Note:

careful with the sorting, if has same index, 1)sort larger first when start and 2) sort smaller first when end 3) if one is start and one is end, put start first
take care of end type, first use a priority queue to keep track current max. height, and use hashmap to know current height number