https://leetcode.com/problems/meeting-rooms-ii/
class Solution {
public:
bool cmp(const Interval &a, const Interval &b) {
return a.start < b.start;
}
int minMeetingRooms(vector<Interval>& intervals) {
sort(intervals.begin(), intervals.end(), cmp);
priority_queue<int, vector<int>, greater<int>> q;
for (auto a : intervals) {
if (!q.empty() && q.top() <= a.start) q.pop();
q.push(a.end);
}
return q.size();
}
};
https://leetcode.com/problems/meeting-rooms-ii/
253.会议室[https://leetcode.cn/problems/meeting-rooms-ii/] 题...
Given an array of meeting time intervals consisting of st...
Description: Given an array of meeting time intervals con...
扫描线算法，如下两种实现方式： 1. TreeMap 2. 用struct来建立对应关系
Given an array of meeting time intervals consisting of st...
两个数组，一个存start，一个存end，分别sort。如果当前start >= end[last]，说明这个st...
今天每日一题253. Meeting rooms II 用什么算法？ 这道题首先要理解题意，为了用最少的房间来安排...
确定一对数组经过合并后可产生几个结果，对数组的起始节点和终止节点进行分离排序，确定判断隔离的条件 start[i]...
本文标题：1.Meeting Rooms II
本文链接：https://www.haomeiwen.com/subject/cvysvttx.html
网友评论