LeetCode Q252: 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.

Solution:

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

view raw Q252.cpp hosted with ❤ by GitHub