search

nagato1208 / nagato1208.github.io

For my blog
2 stars 0 forks source link

leetcode-218 The Skyline Problem | Nagato's blog #7

Open nagato1208 opened 5 years ago

nagato1208 commented 5 years ago

https://nagato1208.github.io/2019/08/25/leetcode-218-The-Skyline-Problem/#more

描述原题在这: https://leetcode.com/problems/the-skyline-problem/ 思路分治分为divide和merge两部分, divide比较简单, 一直对半分, 直到len(buildings) <= 1. 对于merge阶段, 首先这个时候左侧和右侧的list都是要返回的结果的格式即[index, height]. 现在要做的是merge为一组:

nagato1208 commented 4 years ago

回头看线段树解法，发现有点看不懂自己写的解析了。。。sigh