Create Solution2.ts

Author: yanglbme

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

@@ -0,0 +1,10 @@
+function findKthLargest(nums: number[], k: number): number {
+    const minQ = new MinPriorityQueue();
+    for (const x of nums) {
+        minQ.enqueue(x);
+        if (minQ.size() > k) {
+            minQ.dequeue();
+        }
+    }
+    return minQ.front().element;
+}