LeetCode "The Skyline Problem"

weixin_30847939

于 2015-05-29 01:44:00 发布

阅读量47

点赞数

CC 4.0 BY-SA版权

文章标签： c/c++

原文链接：http://www.cnblogs.com/tonix/p/4537480.html

本文探讨了如何使用最大堆和分治策略解决LeetCode中的问题。通过记录被移除的元素和在必要时弹出它们，实现了一个O(nlogn)的时间复杂度解决方案。此外，还提供了一种220ms的Python分治方法。

Good one. My first reaction to this problem is the same idea as this answer: https://leetcode.com/discuss/37365/accepted-c-solution-o-nlogn-using-maxheap

So basically we need a MaxHeap which supports add\remove\top operations. But in C++ priority_queue doesn't support removal of arbitary elements. You may think that your own heap is needed to code, but in the above link, some book-keeping work can be a workaround: we simply record which elements are removed, and we simply pop it out when necessary.

And another solution is "Divide and Conqure": https://leetcode.com/discuss/37444/my-220ms-divide-and-conquer-solution-in-python-o-nlogn

转载于:https://www.cnblogs.com/tonix/p/4537480.html