LeetCode-945 Minimum Increment to Make Array Unique

Description

Given an array of integers A, a move consists of choosing any A[i], and incrementing it by 1.

Return the least number of moves to make every value in A unique.

Note:

1. 0 <= A.length <= 40000
2. 0 <= A[i] < 40000

Example

Example 1:
Input: [1,2,2]
Output: 1
Explanation: After 1 move, the array could be [1, 2, 3].

Example 2:
Input: [3,2,1,2,1,7]
Output: 6
Explanation: 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.

Submissions

解题思路首先将数组排序,初始化总操作次数tmp为0，再循环遍历数组元素，如果当前元素比它前一个元素数值小或者等于，说明有重复，则令当前元素移到比前一元素大一即可，因此，当前操作次数为当前差值加一，让tmp循环累加最后返回结果。

实现代码如下：

class Solution:
    def minIncrementForUnique(self, A: List[int]) -> int:
        A.sort()
        tmp = 0
        for i in range(1, len(A)):
            if A[i]<= A[i-1]:
                tmp += (A[i-1]-A[i]+1)
                A[i] = A[i-1] + 1
                
        return tmp