Time: 74 ms (85.22%), Space: 28.7 MB (24.18%) - LeetHub

Author: wlsgur11

0011-container-with-most-water/0011-container-with-most-water.py

@@ -0,0 +1,9 @@
+class Solution:
+    def maxArea(self, height: List[int]) -> int:
+        start, end = 0, len(height) - 1
+        total = []
+        while start < end:
+            total.append(min(height[start], height[end]) * (end - start))
+            if height[start] < height[end]: start += 1
+            else: end -= 1
+        return max(total)