Time: 662 ms (5.06%) | Memory: 29.9 MB (14.40%) - LeetSync

swolecoder · swolecoder · commit a59d7bb404b8 · 2024-06-10T15:20:01.000-07:00
diff --git a/11-container-with-most-water/container-with-most-water.py b/11-container-with-most-water/container-with-most-water.py
@@ -1,16 +1,20 @@
 class Solution:
     def maxArea(self, height: List[int]) -> int:
-        max_area = float("-inf")
-        l = 0 
-        r = len(height) -1
 
-        while l < r:
+        i = 0
+        j = len(height)-1
+        ans = 0
 
-            area = min(height[l], height[r]) * (r -l)
-            max_area = max(max_area, area)
-            if height[l] < height[r]:
-                l +=1
+        while i < j:
+
+            find_height = min(height[i], height[j])
+            ans = max(ans ,find_height * (j-i))
+            print(ans)
+
+            if height[i] > height[j]:
+                j -=1
             else:
-                r -=1
-        
-        return max_area
+                i +=1
+        return ans 
+
+        
