[LeetCode]Find K Pairs with Smallest Sums@Python

Find K Pairs with Smallest Sums

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

Input: nums1 = [1,7,11], nums2 = [2,4,6], k = 3
Output: [[1,2],[1,4],[1,6]]
Explanation: 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]

Solution

class Solution:
    def kSmallestPairs(self, nums1: List[int], nums2: List[int], k: int) -> List[List[int]]:
        if not nums1 or not nums2:
            return []
        n = len(nums2)
        count = 0
        ret = []
        heap = [(nums1[i]+nums2[0], i, 0) for i in range(len(nums1))]
        while heap and count<k:
            count += 1
            ss, i, j = heapq.heappop(heap)
            ret.append([nums1[i], nums2[j]])
            if j+1<n:
                heapq.heappush(heap, (nums1[i]+nums2[j+1], i, j+1))
        return ret