11_container_with_most_water.py

'''

Given n non-negative integers a1, a2, ..., an, where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of line i is at (i, ai) and (i, 0). Find two lines, which together with x-axis forms a container, such that the container contains the most water.

Note: You may not slant the container and n is at least 2.

'''
class Solution(object):
    def maxArea(self, height):
        """
        :type height: List[int]
        :rtype: int
        """
        l, r = 0, len(height) - 1
        result = 0
        while r > l:
            result = max(result, (r-l)*min(height[r], height[l]))
            if height[r] > height[l]:
                l += 1
            else:
                r -= 1
        return result