class Solution(object):
    def maxArea(self, height):
        """
        :type height: List[int]
        :rtype: int
        """
        if len(height)<2:return 0
        
        left,right=0,len(height)-1
        res,curr=0,0
    
        while left<right:
            curr=(right-left)*min(height[left],height[right])
            res=max(res,curr)
            if height[left]<height[right]:
                left+=1
            else:
                right-=1
            
        return res