Number of Distinct Averages — LeetCode 2465 Python Solution

The problem

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 nums and remove it.

Example

Input

nums = [4,1,4,0,3,5]

Output

2

Explanation

1. Remove 0 and 5, and the average is (0 + 5) / 2 = 2.5. Now, nums = [4,1,4,3].

Python solution

class Solution:
    def distinctAverages(self, nums: List[int]) -> int:
        nums.sort()
        return len(set(nums[i] + nums[-i - 1] for i in range(len(nums) >> 1)))

Complexity

Pattern: Two Pointers

Use the order already in the input to discard half the search space at every step. LeetCode 2465. Number of Distinct Averages is filed here because LeetCode tags it Two Pointers, which is the vocabulary this hub collects.

The two pointers guide has the Python template for the pattern and the 201 LeetCode problems that use it.

Related problems