This post shares a very nice solution using two heaps: a max heap for the smaller half and a min heap for the larger half. The code is rewritten below in C++, simplifying shares a very nice solution using two
阅读背景：
[LeetCode] Find Median from Data Stream
来源：互联网
分享到：
