Leet Code Daily 2024-06-14 - Minimum Increment to Make Array Unique

class Solution {
public:
    int minIncrementForUnique(vector<int>& nums) {
        sort(nums.begin(), nums.end());
        int ans = 0;
        for (int i = 1; i < nums.size(); i++) {
            int diff = max(nums[i - 1] + 1, nums[i]) - nums[i];
            ans += diff;
            nums[i] += diff;
        }
        return ans;
    }
};