Description

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.

Return the maximum amount of water a container can store.

Notice that you may not slant the container.

Example 1:

1
2
3
Input: height = [1,8,6,2,5,4,8,3,7]
Output: 49
Explanation: 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 2:

1
2
Input: height = [1,1]
Output: 1

1
2
3
4
5
Constraints:

n == height.length
2 <= n <= 105
0 <= height[i] <= 104

Approach

1
2
3
4
5
6
7
8
9
10
11
12
class Solution:
    def maxArea(self, height: List[int]) -> int:
        l,r=0, len(height)-1
        area = 0
        while l<r:
            area = max((r-l) * min(height[l], height[r]), area)
            if height[l] < height[r]:
                l+=1
            else:
                r-=1
        
        return area