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.

Example 1:

Input: [[0,30],[5,10],[15,20]]
Output: false

Example 2:

Input: [[7,10],[2,4]]
Output: true
class Solution {
public:
    static bool comp(Interval a, Interval b)
    {
        if(a.start& intervals) {
        sort(intervals.begin(),intervals.end(),comp);
        int cur_end=INT_MIN;
        for(auto i:intervals)
        {
            if(i.start

 

你可能感兴趣的:(LeetCode)