## Problem Statement

Given *n* non-negative integers *a _{1}*,

*a*, ...,

_{2}*a*, where each represents a point at coordinate (

_{n }*i*,

*a*).

_{i}*n*vertical lines are drawn such that the two endpoints of line

*i*is at (

*i*,

*a*) and (

_{i}*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 above 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

**Solution:**

class Solution:
def maxArea(self, height: List[int]) -> int:
n = len(height)
maximum = 0
i=0
j=len(height)-1
while i<j:
if height[i]<height[j]:
maximum = max(maximum, height[i]*(j-i))
i+=1
else:
maximum = max(maximum, height[j]*(j-i))
j-=1
return maximum