Leetcode # 2054. Two Best Non-Overlapping Events

Problem

https://leetcode.com/problems/two-best-non-overlapping-events

Testcases

相關例題

Solution / First Try
[Time Limit Exceeded  36 / 63 testcases passed]

Time Complexity: O(len(events) ** 2)
Space Complexity: O(1)
(The input and output generally do not count towards the space complexity.)

class Solution:
  def maxTwoEvents(self, events: List[List[int]]) -> int:

    max_sum = 0
    for i in range(len(events)):
      max_sum = max(max_sum, events[i][2])
      for j in range(i + 1, len(events)):
        forward_one, back_one = (i, j) if events[i][0] < events[j][0] else (j, i)
        if events[forward_one][1] >= events[back_one][0]: continue
        max_sum = max(max_sum, events[i][2] + events[j][2])

    return max_sum

Last Updated on 2024/12/08 by A1go