Find K-th Smallest Pair Distance
The distance of a pair of integers a and b is defined as the absolute difference between a and b.
Given an integer array nums and an integer k, return the k^th smallest distance among all the pairs nums[i] and nums[j] where 0 <= i < j < nums.length.
Example 1
Input
nums = [1,3,1], k = 1Output
0The pair distances are 2, 0, and 2, so the 1st smallest distance is 0.
Example 2
Input
nums = [1,1,1], k = 2Output
0All pairs have distance 0, so the 2nd smallest distance is 0.
Constraints
- n == nums.length
- 2 <= n <= 10^4
- 0 <= nums[i] <= 10^6
- 1 <= k <= n * (n - 1) / 2