您的位置:首页 > 其它

[LeetCode]--218. The Skyline Problem

2016-08-14 21:15 387 查看






To understand this problem well, See this EXCELLENT EXPLANATION

At the end of this article, it propose to use the Heap data structure to store rectangle with its height as the key!

we know about a data structure which can keep track of an active set of integer-keyed objects and return the highest one in O(logn) time: a heap.

As its hints show, it has 4 data structures to solve these problems!

1.
内容来自用户分享和网络整理,不保证内容的准确性,如有侵权内容,可联系管理员处理 点击这里给我发消息
标签: