mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-10 18:48:13 +08:00
40 lines
1.7 KiB
HTML
40 lines
1.7 KiB
HTML
<p>Design a class to find the <code>k<sup>th</sup></code> largest element in a stream. Note that it is the <code>k<sup>th</sup></code> largest element in the sorted order, not the <code>k<sup>th</sup></code> distinct element.</p>
|
|
|
|
<p>Implement <code>KthLargest</code> class:</p>
|
|
|
|
<ul>
|
|
<li><code>KthLargest(int k, int[] nums)</code> Initializes the object with the integer <code>k</code> and the stream of integers <code>nums</code>.</li>
|
|
<li><code>int add(int val)</code> Appends the integer <code>val</code> to the stream and returns the element representing the <code>k<sup>th</sup></code> largest element in the stream.</li>
|
|
</ul>
|
|
|
|
<p> </p>
|
|
<p><strong>Example 1:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input</strong>
|
|
["KthLargest", "add", "add", "add", "add", "add"]
|
|
[[3, [4, 5, 8, 2]], [3], [5], [10], [9], [4]]
|
|
<strong>Output</strong>
|
|
[null, 4, 5, 5, 8, 8]
|
|
|
|
<strong>Explanation</strong>
|
|
KthLargest kthLargest = new KthLargest(3, [4, 5, 8, 2]);
|
|
kthLargest.add(3); // return 4
|
|
kthLargest.add(5); // return 5
|
|
kthLargest.add(10); // return 5
|
|
kthLargest.add(9); // return 8
|
|
kthLargest.add(4); // return 8
|
|
</pre>
|
|
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>1 <= k <= 10<sup>4</sup></code></li>
|
|
<li><code>0 <= nums.length <= 10<sup>4</sup></code></li>
|
|
<li><code>-10<sup>4</sup> <= nums[i] <= 10<sup>4</sup></code></li>
|
|
<li><code>-10<sup>4</sup> <= val <= 10<sup>4</sup></code></li>
|
|
<li>At most <code>10<sup>4</sup></code> calls will be made to <code>add</code>.</li>
|
|
<li>It is guaranteed that there will be at least <code>k</code> elements in the array when you search for the <code>k<sup>th</sup></code> element.</li>
|
|
</ul>
|