Meeting Rooms II
Source
Given an array of meeting time intervals consisting of start
and end times [[s1,e1],[s2,e2],...] (si < ei),
find the minimum number of conference rooms required.
For example,
Given [[0, 30],[5, 10],[15, 20]],
return 2.
Java
public int minMeetingRooms(Interval[] intervals) {
if (intervals == null || intervals.length == 0)
return 0;
Arrays.sort(intervals, new Comparator<Interval>() {
public int compare(Interval a, Interval b) { return a.start - b.start; }
});
PriorityQueue<Interval> heap = new PriorityQueue<Interval>(intervals.length, new Comparator<Interval>() {
public int compare(Interval a, Interval b) { return a.end - b.end; }
});
heap.offer(intervals[0]);
for (int i = 1; i < intervals.length; i++) {
Interval interval = heap.poll();
if (interval.end <= intervals[i].start) {
interval.end = intervals[i].end;
heap.offer(interval);
} else {
heap.offer(intervals[i]);
heap.offer(interval);
}
}
return heap.size();
}