题意: 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]
Example 2:
Given nums1 = [1,1,2], nums2 = [1,2,3], k = 2
Return: [1,1],[1,1]
The first 2 pairs are returned from the sequence:
[1,1],[1,1],[1,2],[2,1],[1,2],[2,2],[1,3],[1,3],[2,3]
Example 3:
Given nums1 = [1,2], nums2 = [3], k = 3
Return: [1,3],[2,3]
All possible pairs are returned from the sequence:
[1,3],[2,3]
思路:看了Solution的讲解,这题其实思路很多,画出下面的图就方便多了。
2 4 6
+------------
1 | 3 5 7
7 | 9 11 13
11 | 13 15 17
方法一:这个方法比较简单,但是速度会比较慢,itertools.product会构成元组对的列表,在转化成list即可。
def kSmallestPairs(self, nums1, nums2, k):
return map(list, sorted(itertools.product(nums1, nums2), key=sum)[:k])
方法二:这里利用了解包的方法,类似于矩阵的转置,开始形成一个第一列是两数和的列表组,再解包传给merge,由于堆merge是根据列表第一个数来排序的,也就是根据和来排序的,最后取出每一行最后两个数字即可。
def kSmallestPairs(self, nums1, nums2, k):
streams = map(lambda u: ([u+v, u, v] for v in nums2), nums1)
stream = heapq.merge(*streams)
return [suv[1:] for suv in itertools.islice(stream, k)]
方法三:这里也是利用了堆是对列表第一个数来排序的特点,从矩阵左上角向右下移动,每次弹出和最小的加入pairs数组即可。
def kSmallestPairs(self, nums1, nums2, k):
queue = []
def push(i, j):
if i < len(nums1) and j < len(nums2):
heapq.heappush(queue, [nums1[i] + nums2[j], i, j])
push(0, 0)
pairs = []
while queue and len(pairs) < k:
_, i, j = heapq.heappop(queue)
pairs.append([nums1[i], nums2[j]])
push(i, j + 1)
if j == 0:
push(i + 1, 0)
return pairs