mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-11 19:18:14 +08:00
40 lines
1.5 KiB
HTML
40 lines
1.5 KiB
HTML
|
<p>如何得到一个数据流中的中位数？如果从数据流中读出奇数个数值，那么中位数就是所有数值排序之后位于中间的数值。如果从数据流中读出偶数个数值，那么中位数就是所有数值排序之后中间两个数的平均值。</p>
|
|||
|
|
|
|||
|
|
<p>例如，</p>
|
|||
|
|
|
|||
|
|
<p>[2,3,4] 的中位数是 3</p>
|
|||
|
|
|
|||
|
|
<p>[2,3] 的中位数是 (2 + 3) / 2 = 2.5</p>
|
|||
|
|
|
|||
|
|
<p>设计一个支持以下两种操作的数据结构：</p>
|
|||
|
|
|
|||
|
|
<ul>
|
|||
|
|
<li>void addNum(int num) - 从数据流中添加一个整数到数据结构中。</li>
|
|||
|
|
<li>double findMedian() - 返回目前所有元素的中位数。</li>
|
|||
|
|
</ul>
|
|||
|
|
|
|||
|
|
<p><strong>示例 1：</strong></p>
|
|||
|
|
|
|||
|
|
<pre><strong>输入：
|
|||
|
|
</strong>["MedianFinder","addNum","addNum","findMedian","addNum","findMedian"]
|
|||
|
|
[[],[1],[2],[],[3],[]]
|
|||
|
|
<strong>输出：</strong>[null,null,null,1.50000,null,2.00000]
|
|||
|
|
</pre>
|
|||
|
|
|
|||
|
|
<p><strong>示例 2：</strong></p>
|
|||
|
|
|
|||
|
|
<pre><strong>输入：
|
|||
|
|
</strong>["MedianFinder","addNum","findMedian","addNum","findMedian"]
|
|||
|
|
[[],[2],[],[3],[]]
|
|||
|
|
<strong>输出：</strong>[null,null,2.00000,null,2.50000]</pre>
|
|||
|
|
|
|||
|
|
<p> </p>
|
|||
|
|
|
|||
|
|
<p><strong>限制：</strong></p>
|
|||
|
|
|
|||
|
|
<ul>
|
|||
|
|
<li>最多会对 <code>addNum、findMedian</code> 进行 <code>50000</code> 次调用。</li>
|
|||
|
|
</ul>
|
|||
|
|
|
|||
|
|
<p>注意：本题与主站 295 题相同：<a href="https://leetcode-cn.com/problems/find-median-from-data-stream/">https://leetcode-cn.com/problems/find-median-from-data-stream/</a></p>
|