Thanks to visit codestin.com
Credit goes to github.com

Skip to content

Java Solution: Kth Largest Element in an Array #222

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 2 commits into from
Jun 9, 2022
Merged

Java Solution: Kth Largest Element in an Array #222

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
d160036
Create 215-Kth-Largest-Element-in-an-Array.java
GauravVarshikar Apr 26, 2022
43e51e3
Merge pull request #1 from GauravVarshikar/GauravVarshikar-Kth-Largest
GauravVarshikar Apr 26, 2022
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
19 changes: 19 additions & 0 deletions java/215-Kth-Largest-Element-in-an-Array.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,19 @@
class Solution {
public int findKthLargest(int[] nums, int k) {
//create a min heap
PriorityQueue<Integer> heap = new PriorityQueue();

//iterate over the array
for(int n: nums){
//first add the integer to heap
heap.add(n);
//if size of the heap is greater than k
if(heap.size() > k){
//remove the root element (lowest of all)
heap.poll();
}
}
//finally heap has k largest elements left with root as the kth largest element
return heap.peek();
}
}