coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-11-05 20:23:12 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

add scripts and problemset

Browse Source
This commit is contained in:
小墨
2022-03-27 18:27:43 +08:00
parent e632b8e00c
commit adb80564bd
1653 changed files with 379412 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

28
算法题/least-number-of-unique-integers-after-k-removals.html Normal file
View File

@@ -0,0 +1,28 @@
<p>Given an array of integers&nbsp;<code>arr</code>&nbsp;and an integer <code>k</code>.&nbsp;Find the <em>least number of unique integers</em>&nbsp;after removing <strong>exactly</strong> <code>k</code> elements<b>.</b></p>
<ol>
</ol>
<p>&nbsp;</p>
<p><strong>Example 1:</strong></p>
<pre>
<strong>Input: </strong>arr = [5,5,4], k = 1
<strong>Output: </strong>1
<strong>Explanation</strong>: Remove the single 4, only 5 is left.
</pre>
<strong>Example 2:</strong>