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.<p>Hard</p> <p>The <strong>distance of a pair</strong> of integers <code>a</code> and <code>b</code> is defined as the absolute difference between <code>a</code> and <code>b</code>.</p> <p>Given an integer array <code>nums</code> and an integer <code>k</code>, return <em>the</em> <code>k^th</code> <em>smallest <strong>distance among all the pairs</strong></em> <code>nums[i]</code> <em>and</em> <code>nums[j]</code> <em>where</em> <code>0 <= i < j < nums.length</code>.</p> <p><strong>Example 1:</strong></p> <p><strong>Input:</strong> nums = [1,3,1], k = 1</p> <p><strong>Output:</strong> 0</p> <p><strong>Explanation:</strong> Here are all the pairs:</p> <p>(1,3) -> 2</p> <p>(1,1) -> 0</p> <p>(3,1) -> 2</p> <p>Then the 1^st smallest distance pair is (1,1), and its distance is 0.</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> nums = [1,1,1], k = 2</p> <p><strong>Output:</strong> 0</p> <p><strong>Example 3:</strong></p> <p><strong>Input:</strong> nums = [1,6,1], k = 3</p> <p><strong>Output:</strong> 5</p> <p><strong>Constraints:</strong></p> <ul> <li><code>n == nums.length</code></li> <li><code>2 <= n <= 10⁴</code></li> <li><code>0 <= nums[i] <= 10⁶</code></li> <li><code>1 <= k <= n * (n - 1) / 2</code></li> </ul>

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)