LeetCode1353. 最多可以参加的会议数目

1353. Maximum Number of Events That Can Be Attended

[Medium]

Given an array of events where events[i] = [startDayi, endDayi]. Every event i starts at startDayi and ends at endDayi.

You can attend an event i at any day d where startTimei <= d <= endTimei. Notice that you can only attend one event at any time d.

Return the maximum number of events you can attend.

Example 1:

Input: events = [[1,2],[2,3],[3,4]]
Output: 3
Explanation: You can attend all the three events.
One way to attend them all is as shown.
Attend the first event on day 1.
Attend the second event on day 2.
Attend the third event on day 3.

Example 2:

Input: events= [[1,2],[2,3],[3,4],[1,2]]
Output: 4

Example 3:

Input: events = [[1,4],[4,4],[2,2],[3,4],[1,1]]
Output: 4

Example 4:

Input: events = [[1,100000]]
Output: 1

Example 5:

Input: events = [[1,1],[1,2],[1,3],[1,4],[1,5],[1,6],[1,7]]
Output: 7

Constraints:

• 1 <= events.length <= 10^5
• events[i].length == 2
• 1 <= events[i][0] <= events[i][1] <= 10^5

---

题目：给你一个数组 events，其中 events[i] = [startDayi, endDayi] ，表示会议 i 开始于 startDayi ，结束于 endDayi 。你可以在满足 startDayi <= d <= endDayi 中的任意一天 d 参加会议 i 。注意，一天只能参加一个会议。请你返回你可以参加的 最大 会议数目。

思路：参考lee215。首先对events按照startDayi升序排列，然后按照贪心的原则优先安排endTime 小的event。

工程代码下载

class Solution {
public:
    int maxEvents(vector<vector<int>>& events) {
        // 以events[i]的endTime作为依据构建小顶堆
        priority_queue<int, vector<int>, greater<int>> pq;
        sort(events.begin(), events.end());
        int n = events.size();
        int res = 0;

        // 判断第d天的情况
        for(int d = 1, i = 0; d <= 100000; ++d){
            // 排除队列中endTime小于d的所有事件
            while(!pq.empty() && pq.top() < d)
                pq.pop();
            // 将startTime为d的事件对应的endTime添加进队列
            while(i < n && events[i][0] == d)
                pq.push(events[i++][1]);
            // 如果队列非空，则按照贪心的准则在第d天安排队列中endTime最小的事件
            if(!pq.empty()){
                res += 1;
                pq.pop();
            }
        }

        return res;
    }
};