本文介绍了一种算法，该算法能够从两个已排序的整数数组中找到k个具有最小和的数对。举例来说，对于数组nums1=[1,7,11]和nums2=[2,4,6]，当k=3时，返回的最小和数对为[(1,2),(1,4),(1,6)]。
You are given two integer arrays nums1 and nums2 sorted in ascending order and an integer k.
Define a pair (u,v) which consists of one element from the first array and one element from the second array.
Find the k pairs (u1,v1),(u2,v2) …(uk,vk) with the smallest sums.
Example 1:
Given nums1 = [1,7,11], nums2 = [2,4,6], k = 3
Return: [1,2],[1,4],[1,6]
The first 3 pairs are returned from the sequence:
[1,2],[1,4],[1,6],[7,2],[7,4],[11,2],[7,6],[11,4],[11,6]
这道题，其实就是先通过把nums1和nums2的大小和k比较，得出小的那个数分别作为nums1和nums2的大小。因为我们只需要前k个小的数，这样做可以减少时间复杂度。提高效率，同时，我们通过比较用于存储pair的优先级序列heap，去判断是否把足够数量的以及足够小的pair压入heap中，最后把heap中的数压入ans中，返回ans即可
代码如下：
You are given two integer arrays nums1 and nums2 sorted in ascending order and an integer k.
Define a pair (u,v) which consists of one element from the first array and one element from the second array.
Find the k pairs (u1,v1),(u2,v2) ...(uk,vk) with the smallest sums.
Example 1:
Given nums1 = [1,7,11], nums2 = [2,4,6], k = 3
Return: [1,2],[1,4],[1,6]
The first 3 pairs are returned from the sequence:
[1,2],[1,4],[1,6],[7,2],[7,4],[11,2],[7,6],[11,4],[11,6]
扫一扫
411
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
