This commit is contained in:
krahets
2023-08-20 23:28:04 +08:00
parent 26a2e7f171
commit 47b7d6fd44
49 changed files with 161 additions and 162 deletions

View File

@ -3439,7 +3439,7 @@
<div class="admonition tip">
<p class="admonition-title">Tip</p>
<p><span class="arithmatex">\(k = n\)</span> 时,我们可以得到从大到小的序列,等价于选择排序算法。</p>
<p><span class="arithmatex">\(k = n\)</span> 时,我们可以得到从大到小的序列,等价于选择排序算法。</p>
</div>
<h2 id="832">8.3.2 &nbsp; 方法二:排序<a class="headerlink" href="#832" title="Permanent link">&para;</a></h2>
<p>我们可以对数组 <code>nums</code> 进行排序,并返回最右边的 <span class="arithmatex">\(k\)</span> 个元素,时间复杂度为 <span class="arithmatex">\(O(n \log n)\)</span></p>