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