Do water question

Author: Zanger67

my-submissions/h42 v1 heap.py

@@ -0,0 +1,25 @@
+class Solution:
+    def trap(self, height: List[int]) -> int:
+        output = 0
+
+        vals = [(-x, i) for i, x in enumerate(height)]
+        heapify(vals)
+
+        left_max = right_max = heappop(vals)[1]
+        while vals and (left_max > 0 or right_max < len(height) - 1):
+            val, i = heappop(vals)
+            val = -val
+
+            if left_max <= i <= right_max :
+                continue
+
+            if i <= left_max :
+                minn = min(val, height[left_max])
+                output += sum(minn - x for x in height[i + 1:left_max])
+                left_max = i
+            else :
+                minn = min(val, height[right_max])
+                output += sum(minn - x for x in height[right_max + 1:i])
+                right_max = i
+                
+        return output

my-submissions/h42 v2 two pointer.py

@@ -0,0 +1,14 @@
+class Solution:
+    def trap(self, height: List[int]) -> int:
+        left_max = right_max = output = 0 
+        left, right = 0, len(height) - 1
+
+        while left < right :
+            if height[left] < height[right] :
+                output += (left_max := max(left_max, height[left])) - height[left]
+                left += 1
+            else :
+                output += (right_max := max(right_max, height[right])) - height[right]
+                right -= 1
+
+        return output