lint
This commit is contained in:
@@ -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
|
||||
|
||||
Reference in New Issue
Block a user