coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-12 10:51:42 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

批量更新数据

Browse Source
This commit is contained in:
小墨
2025-01-09 20:29:41 +08:00
parent 04ecea043d
commit 48cdd06c2b
5053 changed files with 156164 additions and 135322 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
leetcode-cn/problem (Chinese)/使数组唯一的最小增量 [minimum-increment-to-make-array-unique].html
View File

@@ -2,11 +2,13 @@
<p>返回使 <code>nums</code> 中的每个值都变成唯一的所需要的最少操作次数。</p>
<p>生成的测试用例保证答案在 32 位整数范围内。</p>
<div class="original__bRMd">
<div>
<p>&nbsp;</p>
<p><strong>示例 1：</strong></p>
<p><strong class="example">示例 1：</strong></p>
<pre>
<strong>输入：</strong>nums = [1,2,2]
@@ -14,7 +16,7 @@
<strong>解释：</strong>经过一次 <em>move</em> 操作，数组将变为 [1, 2, 3]。
</pre>
<p><strong>示例 2：</strong></p>
<p><strong class="example">示例 2：</strong></p>
<pre>
<strong>输入：</strong>nums = [3,2,1,2,1,7]