011-container-with-most-water.py

"""
Problem Link: https://leetcode.com/problems/container-with-most-water/

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.

Example:

Input: [1,8,6,2,5,4,8,3,7]
Output: 49
"""
classSolution(object):
defmaxArea(self, height):
"""
 :type height: List[int]
 :rtype: int
 """
maxarea,l,r=0,0,len(height)-1
whilel<r:
maxarea=max(maxarea, min(height[l],height[r])*(r-l))
ifheight[l] <height[r]:
l+=1
else:
r-=1
returnmaxarea