Leetcode NO.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.

本题的做法就是先根据初始点sort一遍，然后就方便找是否重合只要前一点的终点大于后一点的起点，就返回False，本题代码如下：

/**
 * 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) {
        int sz = intervals.size();
        if (sz <= 1) {
            return true;
        }
        sort(intervals.begin(), intervals.end(), comparator);
        for (int i = 0; i < sz - 1; ++i) {
            if (intervals[i].start == intervals[i+1].start or intervals[i].end > intervals[i+1].start) {
                return false;
            }
        }
        return true;
    }
private:
    static bool comparator(Interval i1, Interval i2) {
        return i1.start < i2.start;
    }
};