feat: add ts solution to lc problem: No.0973

Author: rain84

solution/0900-0999/0973.K Closest Points to Origin/README.md

@@ -149,4 +149,32 @@ impl Solution {
 
 <!-- solution:end -->
 
+<!-- solution:start -->
+
+### Solution 2. Priority queue
+
+<!-- tabs:start -->
+
+#### TypeScript
+
+```ts
+function kClosest(points: number[][], k: number): number[][] {
+    const minPQ = new MinPriorityQueue();
+
+    for (const [x, y] of points) {
+        const d = x ** 2 + y ** 2;
+        minPQ.enqueue([x, y], d);
+    }
+
+    const res: number[][] = [];
+    while (k--) res.push(minPQ.dequeue().element);
+
+    return res;
+}
+```
+
+<!-- tabs:end -->
+
+<!-- solution:end -->
+
 <!-- problem:end -->

solution/0900-0999/0973.K Closest Points to Origin/README_EN.md

@@ -141,4 +141,32 @@ impl Solution {
 
 <!-- solution:end -->
 
+<!-- solution:start -->
+
+### Solution 2. Priority queue
+
+<!-- tabs:start -->
+
+#### TypeScript
+
+```ts
+function kClosest(points: number[][], k: number): number[][] {
+    const minPQ = new MinPriorityQueue();
+
+    for (const [x, y] of points) {
+        const d = x ** 2 + y ** 2;
+        minPQ.enqueue([x, y], d);
+    }
+
+    const res: number[][] = [];
+    while (k--) res.push(minPQ.dequeue().element);
+
+    return res;
+}
+```
+
+<!-- tabs:end -->
+
+<!-- solution:end -->
+
 <!-- problem:end -->

solution/0900-0999/0973.K Closest Points to Origin/Solution2.ts

@@ -0,0 +1,13 @@
+function kClosest(points: number[][], k: number): number[][] {
+    const minPQ = new MinPriorityQueue();
+
+    for (const [x, y] of points) {
+        const d = x ** 2 + y ** 2;
+        minPQ.enqueue([x, y], d);
+    }
+
+    const res: number[][] = [];
+    while (k--) res.push(minPQ.dequeue().element);
+
+    return res;
+}