container-with-most-water solution

Author: sejineer

container-with-most-water/sejineer.py

@@ -0,0 +1,17 @@
+"""
+시간 복잡도: O(N)
+공간 복잡도: O(1)
+"""
+class Solution:
+    def maxArea(self, height: List[int]) -> int:
+        result = 0
+        start, end = 0, len(height) - 1
+
+        while start < end:
+            area = (end - start) * min(height[start], height[end])
+            result = max(result, area)
+            if height[start] < height[end]:
+                start += 1
+            else:
+                end -= 1
+        return result