Leetcode-945 Minimum Increment to Make Array Unique(使数组唯一的最小增量)

class Solution
{
    public:
        int minIncrementForUnique(vector<int>& A)
        {
            int a[90000] {0};
            for(int i = 0;i < A.size();i ++)
                a[A[i]] ++;
            
            int result = 0;
            for(int d = 0;d <= 89999;d ++)
            {
                if(a[d]>=2)
                {
                    result += a[d]-1;
                    a[d+1] += a[d]-1;
                } 
            }
            return result;
        }
};