Reduction Operations to Make the Array Elements Equal

Given an integer array nums, your goal is to make all elements in nums equal. To complete one operation, follow these steps:

1. Find the largest value in nums. Let its index be i (0-indexed) and its value be largest. If there are multiple elements with the largest value, pick the smallest i.

2. Find the next largest value in nums strictly smaller than largest. Let its value be nextLargest.

3. Reduce nums[i] to nextLargest.

Return the number of operations to make all elements in nums equal.

LeetCode Problem - 1887

class Solution {
    public int reductionOperations(int[] nums) {
        // Sort the array in non-decreasing order
        Arrays.sort(nums);

        int operations = 0;  // Variable to store the total number of reduction operations
        int n = nums.length; // Get the length of the array

        // Iterate over the sorted array from the second-to-last element down to the first element
        for (int i = n - 1; i > 0; i--) {
            // If the current element is not equal to the previous one, it means we need to perform reduction operations
            if (nums[i] != nums[i - 1]) {
                // The number of operations needed is equal to the number of elements already processed
                operations += (n - i);
            }
        }

        // Return the total number of reduction operations required
        return operations;
    }
}