算法第15周Find K-th Smallest Pair Distance[hard]
来源:互联网 发布:excel筛选数据求和 编辑:程序博客网 时间:2024/06/07 06:25
Description
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 = 1Output: 0 Explanation:Here are all the pairs:(1,3) -> 2(1,1) -> 0(3,1) -> 2Then the 1st smallest distance pair is (1,1), and its distance is 0.
Note:
2 <= len(nums) <= 10000.0 <= nums[i] < 1000000.1 <= k <= len(nums) * (len(nums) - 1) / 2.
Analysis
这道题的意思就是找出第k小的距离,这个距离是数组任意两个数的差的绝对值。如果我们计算出这所有的差值,然后进行排序,找到第k小的距离,这种算法复杂度太高。我们可以采用二分法。
首先我们对数组进行排序,最大的数减最小的数即为距离的最大值,我们假设距离的最小值为0;
我们进行排序必须清楚:(nums为排序后数组)
nums[i]-nums[i-1] < nums[i+1]-nums[i-1];
剩下的就与二分法近似。
Solution
class Solution {public: int smallestDistancePair(vector<int>& nums, int k) { sort(nums.begin(), nums.end()); int s = 0; int h = nums[nums.size()-1]-nums[0]; while (s < h) { int m = (s+h)/2; int count = 0; int left = 0; for (int right = 0; right < nums.size(); right++) { while (nums[right]-nums[left] > m) left++; count += right-left; } if (count >= k) h = m; else s = m+1; } return s; }};
阅读全文
0 0
- 算法第15周Find K-th Smallest Pair Distance[hard]
- 719. Find K-th Smallest Pair Distance
- LeetCode Find K-th Smallest Pair Distance
- LWC 56:719. Find K-th Smallest Pair Distance
- LeetCode Weekly Contest 56 Find K-th Smallest Pair Distance
- LEETCODE: 719 Find K-th Smallest Pair Distance
- leetcode 719. Find K-th Smallest Pair Distance
- Find K-th Smallest Pair Distance:查找数组元素中差值第K大的两个元素的差值
- Find the k-th smallest element
- Find K-th smallest in N sorted arrays
- find the th smallest
- 算法第九周Edit Distance[hard]
- leetcode 440. K-th Smallest in Lexicographical Order 第k个字典序的数字
- give two sorted array, find the k-th smallest element of union of A and B
- Find k-th smallest element in BST (Order Statistics in BST)
- 算法第15周Wildcard Matching[hard]
- k pair of min jaccard distance
- 440. K-th Smallest in Lexicographical Order
- 在webpack中配置babel-loader
- STM32F1和F4实现RS485简单通信
- spring自带的定时任务功能,基于注解和xml配置
- RSelenium包抓取链家网(下:数据存储与容错管理)
- 使用Eclipse在Windows下搭建Redis项目+简单测试
- 算法第15周Find K-th Smallest Pair Distance[hard]
- 机器学习---支持向量机(SVM)算法(下)
- CSDN积分攻略
- json转对象列表
- 面试必备技能
- 为RecyclerView添加分割线
- Ubuntu安装QQ和微信
- C++关机大法
- 前缀和(推一下公式)