此题双层循环超出时长,故看题解
class Solution:
def maxArea(self, height: List[int]) -> int:
#移动短板
left,right,res=0,len(height)-1,0
while left<right:
if height[left]<height[right]:
res=max(res,(right-left)*height[left])
left=left+1
else:
res=max(res,(right-left)*height[right])
right=right-1
return res