Create Solution2.java

Author: yanglbme

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

@@ -0,0 +1,12 @@
+class Solution {
+    public int findKthLargest(int[] nums, int k) {
+        PriorityQueue<Integer> minQ = new PriorityQueue<>();
+        for (int x : nums) {
+            minQ.offer(x);
+            if (minQ.size() > k) {
+                minQ.poll();
+            }
+        }
+        return minQ.peek();
+    }
+}