leetcode.com 373. Find K Pairs with Smallest Sums

문제 링크: https://leetcode.com/problems/find-k-pairs-with-smallest-sums

Author: skysign

leetcode.com 373. Find K Pairs with Smallest Sums/main.py

@@ -0,0 +1,27 @@
+from typing import List
+import heapq
+
+
+class Solution:
+    def kSmallestPairs(self, nums1: List[int], nums2: List[int], k: int) -> List[List[int]]:
+        answer = []
+        heap = []
+        visited = set()
+
+        heapq.heappush(heap, [nums1[0] + nums2[0], 0, 0])
+        visited.add((0, 0))
+
+        while k and heap:
+            _, i, j = heapq.heappop(heap)
+            answer.append([nums1[i], nums2[j]])
+            k -= 1
+
+            if i + 1 < len(nums1) and (i + 1, j) not in visited:
+                heapq.heappush(heap, [nums1[i + 1] + nums2[j], i + 1, j])
+                visited.add((i + 1, j))
+
+            if j + 1 < len(nums2) and (i, j + 1) not in visited:
+                heapq.heappush(heap, [nums1[i] + nums2[j + 1], i, j + 1])
+                visited.add((i, j + 1))
+
+        return answer