problem719

README

< Previous 　　　　　　　　　　　　　　　　 Next >

719. Find K-th Smallest Pair Distance (Hard)

Given an integer array, return the k-th smallest distance among all the pairs. The distance of a pair (A, B) is defined as the absolute difference between A and B.

Example 1:

Input:
nums = [1,3,1]
k = 1
Output: 0 
Explanation:
Here are all the pairs:
(1,3) -> 2
(1,1) -> 0
(3,1) -> 2
Then the 1st smallest distance pair is (1,1), and its distance is 0.

Note:

1. 2 <= len(nums) <= 10000.
2. 0 <= nums[i] < 1000000.
3. 1 <= k <= len(nums) * (len(nums) - 1) / 2.

Related Topics

[Heap] [Array] [Binary Search]

Similar Questions

1. Find K Pairs with Smallest Sums (Medium)
2. Kth Smallest Element in a Sorted Matrix (Medium)
3. Find K Closest Elements (Medium)
4. Kth Smallest Number in Multiplication Table (Hard)
5. K-th Smallest Prime Fraction (Hard)

Hints

Hint 1

Binary search for the answer. How can you check how many pairs have distance <= X?