Maximum Earnings From Taxi LeetCode solution in Python

1
class Solution:
2
    def maxTaxiEarnings(self, n: int, rides: List[List[int]]) -> int:
3
        rides.sort()
4
        for job in rides:
5
            job[2] += job[1] - job[0]
6

7
        heap = []
8
        cur = ans = 0
9
        for start, e, p in rides:
10

11
            while heap and heap[0][0] <= start:
12
                _, val = heappop(heap)
13
                cur = max(cur, val)
14
            heappush(heap, (e, cur + p))
15

16
            ans = max(ans, cur + p)
17

18
        return ans