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