mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-11-04 11:43:12 +08:00
30 lines
1.0 KiB
HTML
30 lines
1.0 KiB
HTML
<p>You are given an integer array <code>nums</code>. In one move, you can pick an index <code>i</code> where <code>0 <= i < nums.length</code> and increment <code>nums[i]</code> by <code>1</code>.</p>
|
|
|
|
<p>Return <em>the minimum number of moves to make every value in </em><code>nums</code><em> <strong>unique</strong></em>.</p>
|
|
|
|
<p> </p>
|
|
<p><strong>Example 1:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> nums = [1,2,2]
|
|
<strong>Output:</strong> 1
|
|
<strong>Explanation:</strong> After 1 move, the array could be [1, 2, 3].
|
|
</pre>
|
|
|
|
<p><strong>Example 2:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> nums = [3,2,1,2,1,7]
|
|
<strong>Output:</strong> 6
|
|
<strong>Explanation:</strong> After 6 moves, the array could be [3, 4, 1, 2, 5, 7].
|
|
It can be shown with 5 or less moves that it is impossible for the array to have all unique values.
|
|
</pre>
|
|
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>1 <= nums.length <= 10<sup>5</sup></code></li>
|
|
<li><code>0 <= nums[i] <= 10<sup>5</sup></code></li>
|
|
</ul>
|