[leetcode 252] Meeting Rooms

Problem Description:

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. 

问题分析：对times排序（升序），然后看看几个时间段有没有重叠的部分。

给定的结构为：

/**

 * Definition for an interval.

 * public class Interval {

 *     int start;

 *     int end;

 *     Interval() { start = 0; end = 0; }

 *     Interval(int s, int e) { start = s; end = e; }

 * }

 */

所以如果s2 < e1 ，说明第一个时间段还有第二个时间段是重叠的。

程序代码如下：

class Solution {

public:

    bool canAttendMeetings(vector<Interval>& intervals) {

        sort(intervals.begin(), intervals.end(),);

        for (int i = 0; i < intervals.size() - 1; i++)

            if (overlap(intervals[i], intervals[i + 1]))

                return false;

        return true;

    }

private:

    bool overlap(Interval& interval1, Interval& interval2) {

        return interval1.end > interval2.start;

    } 

};