[leetcode] 945. Minimum Increment to Make Array Unique : https://leetcode.com/problems/minimum-increment-to-make-array-unique/

Minimum Increment to Make Array Unique.cc

class Solution {
public:
    int minIncrementForUnique(vector<int>& A) {
        if(A.size() < 1) return 0;
        int ans = 0;
        sort(A.begin(), A.end());
        int uniqueNum = A[0];
        for(int i=1;i<A.size();i++){
            uniqueNum++;
            if(uniqueNum <= A[i]){
                uniqueNum = A[i];
            }else{
                // A[i] will be uniqueNum
                ans += uniqueNum - A[i];
            }
        }
        return ans;
    }
};