mirror of
https://gitlab.com/mfocko/LeetCode.git
synced 2024-11-09 15:59:06 +01:00
15 lines
315 B
Java
15 lines
315 B
Java
class Solution {
|
|
public int reductionOperations(int[] nums) {
|
|
Arrays.sort(nums);
|
|
|
|
int counter = 0;
|
|
|
|
for (int i = nums.length - 1; i > 0; --i) {
|
|
if (nums[i - 1] != nums[i]) {
|
|
counter += nums.length - i;
|
|
}
|
|
}
|
|
|
|
return counter;
|
|
}
|
|
}
|