maximum-number-of-events-that-can-be-attended

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

You are given an array of <code>events</code> where <code>events[i] = [startDayi, endDayi]</code>. Every event <code>i</code> starts at <code>startDayi</code> and ends at <code>endDayi</code>.

You can attend an event <code>i</code> at any day <code>d</code> where <code>startTimei &lt;= d &lt;= endTimei</code>. You can only attend one event at any time <code>d</code>.

Return the maximum number of events you can attend.

&nbsp;
Example 1:
<img alt="" src="https://assets.leetcode.com/uploads/2020/02/05/e1.png" style="width: 400px; height: 267px;" />
<pre>
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.
</pre>

Example 2:

<pre>
Input: events= [[1,2],[2,3],[3,4],[1,2]]
Output: 4
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= events.length &lt;= 105</code></li>
	<li><code>events[i].length == 2</code></li>
	<li><code>1 &lt;= startDayi &lt;= endDayi &lt;= 105</code></li>
</ul>

maxEvents

Maximum Number of Events That Can Be Attended

Maximum Number of Events That Can Be Attended II

maximum-number-of-events-that-can-be-attended-ii

最多可以参加的会议数目 II

Maximum Earnings From Taxi

maximum-earnings-from-taxi

出租车的最大盈利

Meeting Rooms III

meeting-rooms-iii

会议室 III

Greedy

Array

Sorting

Heap (Priority Queue)

给你一个数组&nbsp;<code>events</code>，其中&nbsp;<code>events[i] = [startDayi, endDayi]</code>&nbsp;，表示会议&nbsp;<code>i</code>&nbsp;开始于&nbsp;<code>startDayi</code>&nbsp;，结束于&nbsp;<code>endDayi</code>&nbsp;。

你可以在满足&nbsp;<code>startDayi&nbsp;&lt;= d &lt;= endDayi</code>&nbsp;中的任意一天&nbsp;<code>d</code>&nbsp;参加会议&nbsp;<code>i</code>&nbsp;。在任意一天&nbsp;<code>d</code>&nbsp;中只能参加一场会议。

请你返回你可以参加的&nbsp;最大&nbsp;会议数目。

&nbsp;

示例 1：

<img alt="" src="https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2020/02/16/e1.png" style="height: 267px; width: 400px;" />

<pre>
输入：events = [[1,2],[2,3],[3,4]]
输出：3
解释：你可以参加所有的三个会议。
安排会议的一种方案如上图。
第 1 天参加第一个会议。
第 2 天参加第二个会议。
第 3 天参加第三个会议。
</pre>

示例 2：

<pre>
输入：events= [[1,2],[2,3],[3,4],[1,2]]
输出：4
</pre>

&nbsp;

提示：​​​​​​

<ul>
	<li><code>1 &lt;= events.length &lt;= 105</code></li>
	<li><code>events[i].length == 2</code></li>
	<li><code>1 &lt;= startDayi&nbsp;&lt;= endDayi&nbsp;&lt;= 105</code></li>
</ul>