daily

Author: Zanger67

my-submissions/e495.py

@@ -0,0 +1,3 @@
+class Solution:
+    def findPoisonedDuration(self, timeSeries: List[int], duration: int) -> int:
+        return duration + sum(min(duration, y - x) for x, y in zip(timeSeries, timeSeries[1:]))

my-submissions/m1578.py

@@ -0,0 +1,20 @@
+class Solution:
+    def minCost(self, colors: str, neededTime: List[int]) -> int:
+        output = 0
+        curr = 0
+
+        while curr < len(colors) :
+            tot = neededTime[curr]
+            color, maxx = colors[curr], neededTime[curr]
+
+            for i in range(curr + 1, len(colors)) :
+                if colors[i] != color :
+                    break
+                curr = i
+                maxx = max(maxx, neededTime[i])
+                tot += neededTime[i]
+
+            output += tot - maxx
+            curr += 1
+
+        return output

my-submissions/m1801 v1 dual heap O(nlogn).py

@@ -0,0 +1,37 @@
+class Solution:
+    def getNumberOfBacklogOrders(self, orders: List[List[int]]) -> int:
+        # min heap, max heap
+        # (price, amount)
+        sell_reqs, purchase_reqs = [], []
+        for price, amount, order_type in orders :
+            if order_type == 0 : # buy
+                while sell_reqs and sell_reqs[0][0] <= price and amount > 0 :
+                    seller_price, seller_amout = sell_reqs[0]
+
+                    if seller_amout <= amount :
+                        heappop(sell_reqs)
+                    else :
+                        sell_reqs[0][1] -= amount
+
+                    amount = max(0, amount - seller_amout)
+
+                if amount > 0 :
+                    heappush(purchase_reqs, [-price, amount])
+                continue
+            
+            # sell
+            while purchase_reqs and -purchase_reqs[0][0] >= price and amount > 0 :
+                purchaser_price, purchaser_amount = purchase_reqs[0]
+                purchaser_price *= -1
+
+                if purchaser_amount <= amount :
+                    heappop(purchase_reqs)
+                else :
+                    purchase_reqs[0][1] -= amount
+
+                amount = max(0, amount - purchaser_amount)
+
+            if amount > 0 :
+                heappush(sell_reqs, [price, amount])
+
+        return (sum(x[1] for x in sell_reqs) + sum(x[1] for x in purchase_reqs)) % (10 ** 9 + 7)