You are given an integer array height of length n. There are n vertical lines drawn such that the two endpoints of the ith line are (i, 0) and (i, height[i]). Find two lines that together with the x-axis form a container, such that the container contains the most water.
n == height.length, 2 <= n <= 10^5, 0 <= height[i] <= 10^4
Use two pointers at both ends. Calculate area and move the pointer pointing to the shorter line inward (greedy: we can only potentially improve by moving the shorter side).
def maxArea(height):
left, right = 0, len(height) - 1
max_area = 0
while left < right:
width = right - left
h = min(height[left], height[right])
max_area = max(max_area, width * h)
if height[left] < height[right]:
left += 1
else:
right -= 1
return max_area