[Leetcode] 252. Meeting Rooms 解题报告

题目：

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.

For example,
Given [[0, 30],[5, 10],[15, 20]],
return false.

思路：

很简单的一道题目，首先对Interval排序，然后判断前一个meeting的结束时间是否在后一个meeting的开始时间之前即可。

代码：

/**
 * 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(), IntervalComp);
        for(int i = 0; i < (int)intervals.size() - 1; ++i) {
            if(intervals[i].end > intervals[i+1].start) {
                return false;
            }
        }
        return true;
    }
private:
    struct IntervalCompare {
        bool operator() (const Interval& a, const Interval& b) {
            if(a.start < b.start) {
                return true;
            }
            else if(a.start > b.start) {
                return false;
            }
            else {
                return a.end < b.end;
            }
        }
    } IntervalComp;
};