mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-11 02:58:13 +08:00
20 lines
794 B
HTML
20 lines
794 B
HTML
|
<p>Given an integer array <code>nums</code> and an integer <code>k</code>, return <em>the</em> <code>k<sup>th</sup></code> <em>largest element in the array</em>.</p>
|
||
|
|
|
||
|
|
<p>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> </p>
|
||
|
|
<p><strong>Example 1:</strong></p>
|
||
|
|
<pre><strong>Input:</strong> nums = [3,2,1,5,6,4], k = 2
|
||
|
|
<strong>Output:</strong> 5
|
||
|
|
</pre><p><strong>Example 2:</strong></p>
|
||
|
|
<pre><strong>Input:</strong> nums = [3,2,3,1,2,4,5,5,6], k = 4
|
||
|
|
<strong>Output:</strong> 4
|
||
|
|
</pre>
|
||
|
|
<p> </p>
|
||
|
|
<p><strong>Constraints:</strong></p>
|
||
|
|
|
||
|
|
<ul>
|
||
|
|
<li><code>1 <= k <= nums.length <= 10<sup>4</sup></code></li>
|
||
|
|
<li><code>-10<sup>4</sup> <= nums[i] <= 10<sup>4</sup></code></li>
|
||
|
|
</ul>
|