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.

The vertical lines are represented by array [1,8,6,2,5,4,8,3,7]. 
In this case, the max area of water (blue section) the container can contain is 49.

Example:
Input: [1,8,6,2,5,4,8,3,7]
Output: 49
'''

class Solution:
    def maxArea(self, height):
        l = len(height)
        f = 0
        b = l-1
        maxm = 0
        while(f<b):
            maxm = max(maxm,(b-f)*min(height[f],height[b]))
            if(height[f]>height[b]):
                b -= 1
            else:
                f += 1
        return maxm