[LeetCode] Meeting Rooms 会议室-min_heap, sort, greedy

252. Meeting Rooms
     解法：
     按start排序，只要有overlap就是false，比较简单。

Given an array of meeting time intervals consisting of start and end times [[s1,e1],[s2,e2],…] (si < ei), determine if a person could attend all meetings.

/**
 * 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:
    bool canAttendMeetings(vector<Interval>& intervals) {
        sort(intervals.begin(), intervals.end(), [](const Interval &a, const Interval &b){return a.start < b.start;});      
        for(int i = 1; i < intervals.size(); i++)
        {
            if(intervals[i].start < intervals[i - 1].end)
            {
                return false;
            }
        }   
        return true;
    }
};

253. Meeting Rooms II
     这个是followup，需要找出需要的房间个数。
     用minheap保存当前所有会议的结束时间，如果开始时间比最早结束时间晚，就可以重复利用已经结束的会议室，但是需要更新结束时间。
     结束时间是按照从小到大的顺序排序的，最先pop的是最早的结束时间。
     youtube有个视频讲解的非常好。
     https://www.youtube.com/watch?v=wB884_Os58U
     tips：minheap的写法，

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.

/**
 * 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) {       
     
        sort(intervals.begin(), intervals.end(), compare);
        
        priority_queue<int, vector<int>, greater<int>>q;            
        
        for(int i = 0; i < intervals.size(); i++)
        {
            if(!q.empty() && intervals[i].start >= q.top())
            {
                q.pop();
            }                
            q.push(intervals[i].end);            
        }
        
        return q.size();        
    }
    
    static bool compare(Interval a, Interval b)
    {
        return a.start < b.start;
    }
};