Minimum Increment to Make Array Unique

You are given an integer array nums. In one move, you can pick an index i where 0 <= i < nums.length and increment nums[i] by 1.

Return the minimum number of moves to make every value in nums unique.

The test cases are generated so that the answer fits in a 32-bit integer.

LeetCode Problem - 945

class Solution {
    public int minIncrementForUnique(int[] nums) {
        int ans = 0; // Initialize the answer variable to track total increments
        Arrays.sort(nums); // Sort the input array to simplify the process

        // Iterate through the array starting from the second element
        for (int i = 1; i < nums.length; i++) {
            // If current number is less than or equal to the previous number
            if (nums[i] <= nums[i - 1]) {
                // Calculate how much to increment the current number
                ans += nums[i - 1] - nums[i] + 1;
                // Increment the current number to make it unique
                nums[i] = nums[i - 1] + 1;
            }
        }

        return ans; // Return the total number of increments needed
    }
}