class Solution(object):

    def maxArea(self, height):

        """

        :type height: List[int]

        :rtype: int

        """

        intSum = len(height)

        if intSum <= 1:

            return False

        maxVol=0

        left=0

        right=intSum-1

        while left < right:

            maxVol=max(maxVol,(right-left)*min(height[left],height[right]))

            if height[left] < height[right]:

                left+=1

            else:

                right-=1

        return maxVol