{leetcode}/problems/two-best-non-overlapping-events/[LeetCode - 2054. Two Best Non-Overlapping Events ^]
You are given a 0-indexed 2D integer array of events where events[i] = [startTime<sub>i</sub>, endTime<sub>i</sub>, value<sub>i</sub>]. The ith event starts at startTime<sub>i</sub><sub> </sub>and ends at endTime<sub>i</sub>, and if you attend this event, you will receive a value of value<sub>i</sub>. 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 t, the next event must start at or after t + 1.
Example 1: <img alt="" src="https://assets.leetcode.com/uploads/2021/09/21/picture5.png" style="width: 400px; height: 75px;" />
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.
Example 2: <img alt="Example 1 Diagram" src="https://assets.leetcode.com/uploads/2021/09/21/picture1.png" style="width: 400px; height: 77px;" />
Input: events = [[1,3,2],[4,5,2],[1,5,5]] Output: 5 *Explanation: *Choose event 2 for a sum of 5.
Example 3: <img alt="" src="https://assets.leetcode.com/uploads/2021/09/21/picture3.png" style="width: 400px; height: 66px;" />
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.
Constraints:
-
2 ⇐ events.length ⇐ 105 -
events[i].length == 3 -
1 ⇐ startTime<sub>i</sub> ⇐ endTime<sub>i</sub> ⇐ 109 -
1 ⇐ value<sub>i</sub> ⇐ 106