Leetcode-Medium 11. Container With Most Water

class Solution:
    def maxArea(self, height: 'List[int]') -> 'int':
        # 代码超时
        # maxa=0
        # for i in range(len(height)-1):
        #     cura=0
        #     for j in range(i,len(height)):
        #         cura=(j-i)*min(height[j],height[i])
        #         if cura>maxa:
        #             maxa=cura
        # return maxa
        left,right=0,len(height)-1
        maxa=0
        while left<right:
            maxa=max((right-left)*min(height[left],height[right]),maxa)
            if height[left]<height[right]:
                left+=1
            else:
                right-=1
        return maxa