class Solution {
public int minIncrementForUnique(int[] A) {
if (A == null || A.length == 0) {
return 0;
}
Arrays.sort(A);
int sum = 0;
for (int i = 1; i < A.length; i++) {
if (A[i] <= A[i-1]) {
int curr = A[i-1] + 1; //当前应该是什么值
sum += curr - A[i]; //自增多少次
A[i] = curr;
}
}
return sum;
}
}