Leetcode 252. Meeting Rooms (Easy) (cpp)

最新推荐文章于 2024-07-30 10:22:26 发布

Niko_Ke

最新推荐文章于 2024-07-30 10:22:26 发布

阅读量498

点赞数

分类专栏： Leetcode C++ C++ Leetcode Sort 文章标签： leetcode cpp

本文链接：https://blog.csdn.net/niko_ke/article/details/53631683

版权

C++ 同时被 3 个专栏收录

299 篇文章 0 订阅

订阅专栏

Leetcode C++

287 篇文章 0 订阅

订阅专栏

Leetcode Sort

14 篇文章 0 订阅

订阅专栏

Leetcode 252. Meeting Rooms (Easy) (cpp)

Tag: Sort

Difficulty: Easy

/*

252. Meeting Rooms (Easy)

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.

*/
/**
* 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 Comp {
public:
	bool operator()(Interval i1, Interval i2) {
		return i1.end < i2.end;
	}
} comp;
class Solution {
public:
	bool canAttendMeetings(vector<Interval>& intervals) {
		if (intervals.empty()) {
			return true;
		}
		sort(intervals.begin(), intervals.end(), comp);
		for (int i = 0; i < intervals.size() - 1; i++) {
			if (intervals[i].end > intervals[i + 1].start) {
				return false;
			}
		}
		return true;
	}
};