[CLOSED]LEET0011_CONTAINER_WITH_MOST_WATER.py

#coding=utf-8

#Array #Two Pointers

"""
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.
"""

def maxArea(height):
	max_area,i,j = 0, 0, len(height)-1
	while (i < j):
		max_area = max(max_area, (j-i)*min(height[i],height[j]))
		if (height[i] < height[j]):
			i += 1
		else:
			j -= 1
	return max_area