https://leetcode.cn/problems/find-k-pairs-with-smallest-sums

Author: masx200

README.md

@@ -10,6 +10,8 @@ leetcode 测试
 
 ##### 包含的内容如下
 
+https://leetcode.cn/problems/find-k-pairs-with-smallest-sums
+
 https://leetcode.cn/problems/compare-version-numbers
 
 https://leetcode.cn/problems/t9-lcci/

find-k-pairs-with-smallest-sums/index.ts

@@ -0,0 +1,26 @@
+function kSmallestPairs(
+    nums1: number[],
+    nums2: number[],
+    k: number,
+): number[][] {
+    const res: number[][] = [];
+    const m = nums1.length, n = nums2.length;
+    const pq = new Heap<[number, number]>((a, b) =>
+        nums1[a[0]] + nums2[a[1]] - nums1[b[0]] - nums2[b[1]]
+    );
+    for (const i of Array(Math.min(k, m)).keys()) {
+        pq.push([i, 0]);
+    }
+    while (k-- && !pq.isEmpty()) {
+        const top = pq.pop();
+
+        res.push([nums1[top[0]], nums2[top[1]]]);
+
+        if (top[1] + 1 < n) {
+            pq.push([top[0], top[1] + 1]);
+        }
+    }
+    return res;
+}
+export default kSmallestPairs;
+import { Heap } from "https://esm.sh/@datastructures-js/[email protected]/src/heap.js";