题目:
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
.
两种做法。都需要先根据start排序原数组。然后要么用最小堆,要么对每一个start,遍历end,比较end是否小于等于start。
C++的priority_queue是最大堆,Java的PriorityQueue和Python的heapq是最小堆。面试的时候可以需求选择适当的语言。
C++版:
/**
* Definition for an interval.
* struct Interval {
* int start;
* int end;
* Interval() : start(0), end(0) {}
* Interval(int s, int e) : start(s), end(e) {}
* };
*/
class Solution {
public:
int minMeetingRooms(vector<Interval>& intervals) {
vector<int> s(intervals.size());
vector<int> e(intervals.size());