Create 1642-furthest-building-you-can-reach.kt

Author: a93a

python/1642-furthest-building-you-can-reach.kt

@@ -0,0 +1,19 @@
+class Solution:
+    def furthestBuilding(self, heights: List[int], bricks: int, ladders: int) -> int:
+        heap = []
+
+        for i in range(len(heights) - 1):
+            diff = heights[i + 1] - heights[i]
+            if diff <= 0:
+                continue
+
+            bricks -= diff
+            heapq.heappush(heap, -diff)
+
+            if bricks < 0:
+                if ladders == 0:
+                    return i
+                ladders -= 1
+                bricks += -heapq.heappop(heap)
+            
+        return len(heights) - 1