mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-11 02:58:13 +08:00
35 lines
1.4 KiB
HTML
35 lines
1.4 KiB
HTML
<p>You are given an array of <code>events</code> where <code>events[i] = [startDay<sub>i</sub>, endDay<sub>i</sub>]</code>. Every event <code>i</code> starts at <code>startDay<sub>i</sub></code><sub> </sub>and ends at <code>endDay<sub>i</sub></code>.</p>
|
|
|
|
<p>You can attend an event <code>i</code> at any day <code>d</code> where <code>startTime<sub>i</sub> <= d <= endTime<sub>i</sub></code>. You can only attend one event at any time <code>d</code>.</p>
|
|
|
|
<p>Return <em>the maximum number of events you can attend</em>.</p>
|
|
|
|
<p> </p>
|
|
<p><strong>Example 1:</strong></p>
|
|
<img alt="" src="https://assets.leetcode.com/uploads/2020/02/05/e1.png" style="width: 400px; height: 267px;" />
|
|
<pre>
|
|
<strong>Input:</strong> events = [[1,2],[2,3],[3,4]]
|
|
<strong>Output:</strong> 3
|
|
<strong>Explanation:</strong> 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>
|
|
|
|
<p><strong>Example 2:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> events= [[1,2],[2,3],[3,4],[1,2]]
|
|
<strong>Output:</strong> 4
|
|
</pre>
|
|
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>1 <= events.length <= 10<sup>5</sup></code></li>
|
|
<li><code>events[i].length == 2</code></li>
|
|
<li><code>1 <= startDay<sub>i</sub> <= endDay<sub>i</sub> <= 10<sup>5</sup></code></li>
|
|
</ul>
|