two-best-non-overlapping-events

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 a 0-indexed 2D integer array of <code>events</code> where <code>events[i] = [startTimei, endTimei, valuei]</code>. The <code>ith</code> event starts at <code>startTimei</code> and ends at <code>endTimei</code>, and if you attend this event, you will receive a value of <code>valuei</code>. You can choose at most two non-overlapping events to attend such that the sum of their values is maximized.

Return this maximum sum.

Note that the start time and end time is inclusive: that is, you cannot attend two events where one of them starts and the other ends at the same time. More specifically, if you attend an event with end time <code>t</code>, the next event must start at or after <code>t + 1</code>.

&nbsp;
Example 1:
<img alt="" src="https://assets.leetcode.com/uploads/2021/09/21/picture5.png" style="width: 400px; height: 75px;" />
<pre>
Input: events = [[1,3,2],[4,5,2],[2,4,3]]
Output: 4
Explanation: Choose the green events, 0 and 1 for a sum of 2 + 2 = 4.
</pre>

Example 2:
<img alt="Example 1 Diagram" src="https://assets.leetcode.com/uploads/2021/09/21/picture1.png" style="width: 400px; height: 77px;" />
<pre>
Input: events = [[1,3,2],[4,5,2],[1,5,5]]
Output: 5
Explanation: Choose event 2 for a sum of 5.
</pre>

Example 3:
<img alt="" src="https://assets.leetcode.com/uploads/2021/09/21/picture3.png" style="width: 400px; height: 66px;" />
<pre>
Input: events = [[1,5,3],[1,5,1],[6,6,5]]
Output: 8
Explanation: Choose events 0 and 2 for a sum of 3 + 5 = 8.</pre>

&nbsp;
Constraints:

<ul>
	<li><code>2 &lt;= events.length &lt;= 105</code></li>
	<li><code>events[i].length == 3</code></li>
	<li><code>1 &lt;= startTimei &lt;= endTimei &lt;= 109</code></li>
	<li><code>1 &lt;= valuei &lt;= 106</code></li>
</ul>

maxTwoEvents

Two Best Non-Overlapping Events

Maximum Profit in Job Scheduling

maximum-profit-in-job-scheduling

规划兼职工作

Maximum Number of Events That Can Be Attended II

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

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

Maximize Win From Two Segments

maximize-win-from-two-segments

两个线段获得的最多奖品

Maximum Score of Non-overlapping Intervals

maximum-score-of-non-overlapping-intervals

不重叠区间的最大得分

Array

Binary Search

Dynamic Programming

Sorting

Heap (Priority Queue)

给你一个下标从 0&nbsp;开始的二维整数数组&nbsp;<code>events</code>&nbsp;，其中&nbsp;<code>events[i] = [startTimei, endTimei, valuei]</code>&nbsp;。第&nbsp;<code>i</code>&nbsp;个活动开始于&nbsp;<code>startTimei</code>&nbsp;，结束于&nbsp;<code>endTimei</code>&nbsp;，如果你参加这个活动，那么你可以得到价值&nbsp;<code>valuei</code>&nbsp;。你 最多&nbsp;可以参加&nbsp;两个时间不重叠&nbsp;活动，使得它们的价值之和 最大&nbsp;。

请你返回价值之和的 最大值&nbsp;。

注意，活动的开始时间和结束时间是 包括&nbsp;在活动时间内的，也就是说，你不能参加两个活动且它们之一的开始时间等于另一个活动的结束时间。更具体的，如果你参加一个活动，且结束时间为 <code>t</code>&nbsp;，那么下一个活动必须在&nbsp;<code>t + 1</code>&nbsp;或之后的时间开始。

&nbsp;

示例 1:

<img alt="" src="https://assets.leetcode.com/uploads/2021/09/21/picture5.png" style="width: 400px; height: 75px;">

<pre>输入：events = [[1,3,2],[4,5,2],[2,4,3]]
输出：4
解释：选择绿色的活动 0 和 1 ，价值之和为 2 + 2 = 4 。
</pre>

示例 2：

<img alt="Example 1 Diagram" src="https://assets.leetcode.com/uploads/2021/09/21/picture1.png" style="width: 400px; height: 77px;">

<pre>输入：events = [[1,3,2],[4,5,2],[1,5,5]]
输出：5
解释：选择活动 2 ，价值和为 5 。
</pre>

示例 3：

<img alt="" src="https://assets.leetcode.com/uploads/2021/09/21/picture3.png" style="width: 400px; height: 66px;">

<pre>输入：events = [[1,5,3],[1,5,1],[6,6,5]]
输出：8
解释：选择活动 0 和 2 ，价值之和为 3 + 5 = 8 。</pre>

&nbsp;

提示：

<ul>
	<li><code>2 &lt;= events.length &lt;= 105</code></li>
	<li><code>events[i].length == 3</code></li>
	<li><code>1 &lt;= startTimei &lt;= endTimei &lt;= 109</code></li>
	<li><code>1 &lt;= valuei &lt;= 106</code></li>
</ul>