本文探讨了使用两个堆（左堆和右堆）来维护数据流中位数的方法，并介绍了二叉搜索树（BST）及其在处理奇偶数变化时的应用。通过对不同情况的分析，展示了如何在数据结构中高效地保持中位数。
error:
cannot slove it.
-
Use two heap, first the keep store left half and other for right heap. And
0 <= |left.size() - right| <= 1. If violent the rule, move to top number to other side. If current num larger than left.top(), push to right, otherwise push to left. -
Use BST, and multiset is implement of BST. We have 4 case:
odd -> even
- num < r: l–
- num >= r: r++
even ->odd - num < r: r–, l = r
- num >= r: l = r
扫一扫
552
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
