会议室

给定一系列的会议时间间隔，包括起始和结束时间[[s1,e1]，[s2,e2]，…(si < ei)，确定一个人是否可以参加所有会议。

样例

样例1

输入: intervals = [(0,30),(5,10),(15,20)]
输出: false
解释:
(0,30), (5,10) 和 (0,30),(15,20) 这两对会议会冲突

样例2

输入: intervals = [(5,8),(9,15)]
输出: true
解释:
这两个时间段不会冲突

 

/**
 * Definition of Interval:
 * class Interval {
 *     int start, end;
 *     Interval(int start, int end) {
 *         this->start = start;
 *         this->end = end;
 *     }
 * }
 */
 
bool mycmp(Interval& A, Interval& B)
{
    if(A.end < B.end)
        return true;
    return false;
}

class Solution {
public:
    /**
     * @param intervals: an array of meeting time intervals
     * @return: if a person could attend all meetings
     */
    bool canAttendMeetings(vector<Interval> &intervals) {
        // Write your code here
        if(intervals.size() == 0)
            return true;
        sort(intervals.begin(), intervals.end(), mycmp);
        
        int count = 1;
        //int end = intervals[0][1];
        int end = intervals[0].end;
        for(int i = 0; i < intervals.size(); i++)
        {
            if(intervals[i].start >= end)
            {
                count++;
                end =  intervals[i].end;
            }
        }
        return count == intervals.size();
    }
};