update

Author: KaidiGuo

Sliding window/3. Longest Substring Without Repeating Characters.py

@@ -0,0 +1,16 @@
+class Solution:
+    def carPooling(self, trips: List[List[int]], capacity: int) -> bool:
+        orders=[]
+        for p, st, en in trips:
+            orders.append((st,p))
+            orders.append((en,-p))
+
+        orders.sort()
+        p=0
+        for item in orders:
+            p += item[1]
+            if p > capacity:
+                return False
+            
+        return True
+

resource ocupation/1094. Car Pooling.py

@@ -0,0 +1,22 @@
+class MyCalendarTwo:
+
+    def __init__(self):
+        self.orders=[]
+
+        
+
+    def book(self, start: int, end: int) -> bool:
+        orders=self.orders
+        bisect.insort(orders,(start,1))
+        bisect.insort(orders,(end,-1))
+        
+        limit=3
+        count=0
+        for item in orders:
+            count+=item[1]
+            if count ==limit:
+                orders.pop(bisect_left(orders, (start,1)))
+                orders.pop(bisect_left(orders, (end,-1)))
+
+                return False
+        return True