Class Solution
-
- All Implemented Interfaces:
public final class Solution
2054 - Two Best Non-Overlapping Events\.
Medium
You are given a 0-indexed 2D integer array of
events
where <code>eventsi = startTime<sub>i</sub>, endTime<sub>i</sub>, value<sub>i</sub></code>. The <code>i<sup>th</sup></code> event starts at <code>startTime<sub>i</sub></code> and ends at <code>endTime<sub>i</sub></code>, and if you attend this event, you will receive a value of <code>value<sub>i</sub></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
t
, the next event must start at or aftert + 1
.Example 1:
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:
Input: events = \[\[1,3,2],4,5,2,1,5,5]
Output: 5
Explanation: Choose event 2 for a sum of 5.
Example 3:
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:
<code>2 <= events.length <= 10<sup>5</sup></code>
events[i].length == 3
<code>1 <= startTime<sub>i</sub><= endTime<sub>i</sub><= 10<sup>9</sup></code>
<code>1 <= value<sub>i</sub><= 10<sup>6</sup></code>
-
-
Constructor Summary
Constructors Constructor Description Solution()
-
Method Summary
Modifier and Type Method Description final Integer
maxTwoEvents(Array<IntArray> events)
-
-
Method Detail
-
maxTwoEvents
final Integer maxTwoEvents(Array<IntArray> events)
-
-
-
-