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

Author: rain84

solution/0700-0799/0703.Kth Largest Element in a Stream/README.md

@@ -349,6 +349,30 @@ class MinHeap {
  */
 ```
 
+#### TypeScript
+
+```ts
+export class KthLargest {
+    #pq = new MinPriorityQueue();
+    #k = 0;
+
+    constructor(k: number, nums: number[]) {
+        this.#k = k;
+        for (const x of nums) {
+            this.#pq.enqueue(x);
+            if (this.#pq.size() > k) this.#pq.dequeue();
+        }
+    }
+
+    add(val: number): number {
+        this.#pq.enqueue(val);
+        if (this.#pq.size() > this.#k) this.#pq.dequeue();
+
+        return this.#pq.front().element;
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/0700-0799/0703.Kth Largest Element in a Stream/README_EN.md

@@ -348,6 +348,30 @@ class MinHeap {
  */
 ```
 
+#### TypeScript
+
+```ts
+export class KthLargest {
+    #pq = new MinPriorityQueue();
+    #k = 0;
+
+    constructor(k: number, nums: number[]) {
+        this.#k = k;
+        for (const x of nums) {
+            this.#pq.enqueue(x);
+            if (this.#pq.size() > k) this.#pq.dequeue();
+        }
+    }
+
+    add(val: number): number {
+        this.#pq.enqueue(val);
+        if (this.#pq.size() > this.#k) this.#pq.dequeue();
+
+        return this.#pq.front().element;
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/0700-0799/0703.Kth Largest Element in a Stream/Solution.ts

@@ -0,0 +1,19 @@
+export class KthLargest {
+    #pq = new MinPriorityQueue();
+    #k = 0;
+
+    constructor(k: number, nums: number[]) {
+        this.#k = k;
+        for (const x of nums) {
+            this.#pq.enqueue(x);
+            if (this.#pq.size() > k) this.#pq.dequeue();
+        }
+    }
+
+    add(val: number): number {
+        this.#pq.enqueue(val);
+        if (this.#pq.size() > this.#k) this.#pq.dequeue();
+
+        return this.#pq.front().element;
+    }
+}