Package g0701_0800.s0719_find_k_th_smallest_pair_distance

Class Solution

java.lang.Object

g0701_0800.s0719_find_k_th_smallest_pair_distance.Solution

public class Solution
extends Object

719 - Find K-th Smallest Pair Distance\. Hard 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_ kth _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 = 1 **Output:** 0 **Explanation:** Here are all the pairs: (1,3) -> 2 (1,1) -> 0 (3,1) -> 2 Then the 1^st smallest distance pair is (1,1), and its distance is 0. **Example 2:** **Input:** nums = [1,1,1], k = 2 **Output:** 0 **Example 3:** **Input:** nums = [1,6,1], k = 3 **Output:** 5 **Constraints:** * `n == nums.length` * 2 <= n <= 104 * 0 <= nums[i] <= 106 * `1 <= k <= n * (n - 1) / 2`

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
int	smallestDistancePair(int[] nums, int k)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Solution

public Solution()

Method Details

smallestDistancePair

public int smallestDistancePair(int[] nums,
 int k)