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

Author: rain84

solution/0200-0299/0215.Kth Largest Element in an Array/README.md

@@ -309,4 +309,30 @@ impl Solution {
 
 <!-- solution:end -->
 
+<!-- solution:start -->
+
+### Solution 3: Max priority heap
+
+<!-- tabs:start -->
+
+#### TypeScript
+
+```ts
+function findKthLargest(nums: number[], k: number): number {
+    const maxPQ = new MaxPriorityQueue();
+    for (const x of nums) {
+        maxPQ.enqueue(x);
+    }
+
+    let res = 0;
+    while (k--) res = maxPQ.dequeue().element;
+
+    return res;
+}
+```
+
+<!-- tabs:end -->
+
+<!-- solution:end -->
+
 <!-- problem:end -->

solution/0200-0299/0215.Kth Largest Element in an Array/README_EN.md

@@ -301,4 +301,30 @@ impl Solution {
 
 <!-- solution:end -->
 
+<!-- solution:start -->
+
+### Solution 3: Max priority heap
+
+<!-- tabs:start -->
+
+#### TypeScript
+
+```ts
+function findKthLargest(nums: number[], k: number): number {
+    const maxPQ = new MaxPriorityQueue();
+    for (const x of nums) {
+        maxPQ.enqueue(x);
+    }
+
+    let res = 0;
+    while (k--) res = maxPQ.dequeue().element;
+
+    return res;
+}
+```
+
+<!-- tabs:end -->
+
+<!-- solution:end -->
+
 <!-- problem:end -->

solution/0200-0299/0215.Kth Largest Element in an Array/Solution3.ts

@@ -0,0 +1,11 @@
+function findKthLargest(nums: number[], k: number): number {
+    const maxPQ = new MaxPriorityQueue();
+    for (const x of nums) {
+        maxPQ.enqueue(x);
+    }
+
+    let res = 0;
+    while (k--) res = maxPQ.dequeue().element;
+
+    return res;
+}