/**
sort가 없는 상황에서는 heap, priority queue를 쓰면.. 이러한 상황을 극복할 수 있다..
*/
import java.util.PriorityQueue;
import java.util.Collections;
class Solution {
public int findKthLargest(int[] nums, int k) {
PriorityQueue<Integer> pq = new PriorityQueue<>(Collections.reverseOrder());
for(int n: nums) {
pq.add(n);
}
for(int i = 0; i < k - 1; i++) {
pq.poll();
}
return pq.poll();
}
}
'코딩테스트' 카테고리의 다른 글
[leetcode] 374. Guess Number Higher or Lower (0) | 2024.05.31 |
---|---|
[leetcode] 17. Letter Combinations of a Phone Number (0) | 2024.05.28 |
[leetcode] 1926. Nearest Exit from Entrance in Maze (0) | 2024.05.26 |
[leetcode] 841. Keys and Rooms (0) | 2024.05.26 |
[leetcode] 104. Maximum Depth of Binary Tree (0) | 2024.05.23 |