252. Meeting Rooms

252. Meeting Rooms

Description

Given an array of meeting time intervalswhere intervals[i] = [starti, endi], determine if a person could attend all meetings.

Example 1:

1
2
Input: intervals = [[0,30],[5,10],[15,20]]
Output: false

Example 2:

1
2
Input: intervals = [[7,10],[2,4]]
Output: true

Constraints:

  • 0 <= intervals.length <= 10^4
  • intervals[i].length == 2
  • 0 <= starti <endi <= 10^6

Hints/Notes

  • 2025/01/03
  • sort
  • premium

Solution

Language: C++

1
2
3
4
5
6
7
8
9
10
11
12
13
14
class Solution {
public:
bool canAttendMeetings(vector<vector<int>>& intervals) {
ranges::sort(intervals);
int end = -1;
for (auto interval : intervals) {
if (interval[0] < end) {
return false;
}
end = max(end, interval[1]);
}
return true;
}
};