leetcode 719. Find K-th Smallest Pair Distance c++

本文介绍了一种解决寻找整数数组中第k小距离对问题的高效算法。通过排序和二分查找,该算法能在O(n log n)的时间复杂度内找到所有数对中距离最小的前k个。示例中,对于输入数组[1,3,1]和k=1,输出为0,即最近的数对(1,1)的距离。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

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.
class Solution {
public:
    int smallestDistancePair(vector<int>& nums, int k) 
    {
        int len = nums.size();
        sort(nums.begin(),nums.end());
        int left = 0;
        int right = nums[len-1]-nums[0];
        int mid=0;
        while(left<right)
        {
            mid = left + (right-left)/2;
            int lowl=0;
            int count = 0;
            for(int upl=0;upl<len;upl++)
            {
                while(nums[upl]-nums[lowl]>mid) lowl++;
                count += upl - lowl;
            }
            if(count<k) left = mid+1;
            else right = mid;
        }
        return left;
    }
};

 

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值