945. Minimum Increment to Make Array Unique

版权声明：本文为博主原创文章，未经博主允许不得转载。 https://blog.csdn.net/M_sdn/article/details/84482971

https://leetcode.com/contest/weekly-contest-112/problems/minimum-increment-to-make-array-unique/

public int minIncrementForUnique(int[] A) {
        Arrays.sort(A);
        int res = 0;
        int pre = 0, cur = 1;

        while (cur<A.length && A[pre] < A[cur]) {
            pre++;
            cur++;
        }
        while (cur<A.length) {
            if (A[pre] >= A[cur]) {
                res += A[pre] - A[cur] + 1;
                A[cur] += A[pre] - A[cur] + 1;
            }
            pre++;
            cur++;
        }
        return res;
    }

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:

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