feat: add 2nd ts solution to lc problem: No.0295

Author: rain84

solution/0200-0299/0295.Find Median from Data Stream/README.md

@@ -422,4 +422,42 @@ public class MedianFinder {
 
 <!-- solution:end -->
 
+<!-- solution:start -->
+
+### Solution 2. Min/max heaps
+
+<!-- tabs:start -->
+
+#### TypeScript
+
+```ts
+class MedianFinder {
+    #minQ = new MinPriorityQueue<number>();
+    #maxQ = new MaxPriorityQueue<number>();
+
+    addNum(num: number): void {
+        const [minQ, maxQ] = [this.#minQ, this.#maxQ];
+        maxQ.enqueue(num);
+        minQ.enqueue(maxQ.dequeue().element);
+        if (minQ.size() > maxQ.size()) {
+            maxQ.enqueue(minQ.dequeue().element);
+        }
+    }
+
+    findMedian(): number {
+        const [minQ, maxQ] = [this.#minQ, this.#maxQ];
+        const median =
+            maxQ.size() === minQ.size()
+                ? (maxQ.front().element + minQ.front().element) / 2
+                : maxQ.front().element;
+
+        return median;
+    }
+}
+```
+
+<!-- tabs:end -->
+
+<!-- solution:end -->
+
 <!-- problem:end -->

solution/0200-0299/0295.Find Median from Data Stream/README_EN.md

@@ -417,4 +417,42 @@ public class MedianFinder {
 
 <!-- solution:end -->
 
+<!-- solution:start -->
+
+### Solution 2. Min/max heaps
+
+<!-- tabs:start -->
+
+#### TypeScript
+
+```ts
+class MedianFinder {
+    #minQ = new MinPriorityQueue<number>();
+    #maxQ = new MaxPriorityQueue<number>();
+
+    addNum(num: number): void {
+        const [minQ, maxQ] = [this.#minQ, this.#maxQ];
+        maxQ.enqueue(num);
+        minQ.enqueue(maxQ.dequeue().element);
+        if (minQ.size() > maxQ.size()) {
+            maxQ.enqueue(minQ.dequeue().element);
+        }
+    }
+
+    findMedian(): number {
+        const [minQ, maxQ] = [this.#minQ, this.#maxQ];
+        const median =
+            maxQ.size() === minQ.size()
+                ? (maxQ.front().element + minQ.front().element) / 2
+                : maxQ.front().element;
+
+        return median;
+    }
+}
+```
+
+<!-- tabs:end -->
+
+<!-- solution:end -->
+
 <!-- problem:end -->

solution/0200-0299/0295.Find Median from Data Stream/Solution2.ts

@@ -0,0 +1,23 @@
+class MedianFinder {
+    #minQ = new MinPriorityQueue<number>();
+    #maxQ = new MaxPriorityQueue<number>();
+
+    addNum(num: number): void {
+        const [minQ, maxQ] = [this.#minQ, this.#maxQ];
+        maxQ.enqueue(num);
+        minQ.enqueue(maxQ.dequeue().element);
+        if (minQ.size() > maxQ.size()) {
+            maxQ.enqueue(minQ.dequeue().element);
+        }
+    }
+
+    findMedian(): number {
+        const [minQ, maxQ] = [this.#minQ, this.#maxQ];
+        const median =
+            maxQ.size() === minQ.size()
+                ? (maxQ.front().element + minQ.front().element) / 2
+                : maxQ.front().element;
+
+        return median;
+    }
+}