human
Solve in Python:
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.
 
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.

 

Note:

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

=====
Give me a the Python code you requested?
assistant
#Here is the Python code you requested.

class Solution:
    def minIncrementForUnique(self, A: List[int]) -> int:
        if not A:
            return 0

        n = len(A)
        A.sort()

        tail_num = A[0]
        result = 0
        for i in range(1, n):
            if A[i] > tail_num:
                tail_num = A[i]
            else:
                tail_num += 1

            # result = result + (tail_num - A[i])
            result += tail_num - A[i]

        return result