Number of Distinct Averages
You are given a 0-indexed integer array nums of even length.
As long as nums is not empty, you must repetitively:
- Find the minimum number in
numsand remove it. - Find the maximum number in
numsand remove it. - Calculate the average of the two removed numbers.
The average of two numbers a and b is (a + b) / 2.
Return the number of distinct averages calculated using the above process.
Note that when there is a tie for a minimum or maximum number, any can be removed.
Example 1
Input
nums = [4,1,4,0,3,5]Output
2Since there are 2 distinct numbers among 2.5, 2.5, and 3.5, we return 2.
Example 2
Input
nums = [1,100]Output
1There is only one average to be calculated after removing 1 and 100, so we return 1.
Constraints
- 2 <= nums.length <= 100
- nums.length is even.
- 0 <= nums[i] <= 100