Minimum Increment to Make Array Unique
You are given an integer array nums. In one move, you can pick an index i where 0 <= i < nums.length and increment nums[i] by 1.
Return the minimum number of moves to make every value in nums unique.
The test cases are generated so that the answer fits in a 32-bit integer.
Example 1
Input
nums = [1,2,2]Output
1After 1 move, the array could be [1, 2, 3].
Example 2
Input
nums = [3,2,1,2,1,7]Output
6After 6 moves, the array could be [3, 4, 1, 2, 5, 7], and it is impossible to make all values unique with 5 or fewer moves.
Constraints
- 1 <= nums.length <= 10^5
- 0 <= nums[i] <= 10^5