253. Meeting Rooms II
Difficulty: Medium
Related Topics: Heap, Greedy, Sort
Given an array of meeting time intervals intervals
where intervals[i] = [start<sub style="display: inline;">i</sub>, end<sub style="display: inline;">i</sub>]
, return the minimum number of conference rooms required.
Example 1:
Input: intervals = [[0,30],[5,10],[15,20]]
Output: 2
Example 2:
Input: intervals = [[7,10],[2,4]]
Output: 1
Constraints:
1 <= intervals.length <= 10<sup>4</sup>
0 <= start<sub style="display: inline;">i</sub> < end<sub style="display: inline;">i</sub> <= 10<sup>6</sup>
Solution
Language: Java
class Solution {
public int minMeetingRooms(int[][] intervals) {
Comparator<int[]> comp = new Comparator<>() {
public int compare(int[] a1, int[] a2) {
return a1[0] - a2[0];
}
};
if (intervals.length == 0) {
return 0;
}
Arrays.sort(intervals, comp);
PriorityQueue<Integer> pq = new PriorityQueue<>(new Comparator<Integer>() {
public int compare(Integer a, Integer b) {
return a - b;
}
});
pq.add(intervals[0][1]);
for (int i = 1; i < intervals.length; i++) {
if (intervals[i][0] >=pq.peek()) {
pq.poll();
}
pq.add(intervals[i][1]);
}
return pq.size();
}
}