This commit is contained in:
2024-05-07 12:56:35 -04:00
parent 1bf5d2ab15
commit c70da65d0f
@@ -4,10 +4,10 @@ class Solution:
r = len(height) - 1
max_area = (r-l) * min(height[l], height[r])
while (r-l > 2):
if (height[l] <= height[r]):
while r-l > 2:
if height[l] <= height[r]:
l += 1
else:
r -= 1
max_area = max(max_area, (r-l) * min(height[l], height[r]))
return max_area
return max_area