Container With Most Water

LeetCode

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:

  • 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.
1def maxArea(height: List[int]) -> int:
2    l, r = 0, len(height) - 1
3    res = 0
4    
5    while l < r:
6        area = (r - l) * min(height[l], height[r])
7        res = max(res, area)
8        
9        if height[l] < height[r]:
10            l += 1
11        else:
12            r -= 1
13            
14    return res
Previous
Remove Duplicates from Sorted Array
Next
Squares of a Sorted Array
l
1
0
8
1
6
2
2
3
5
4
4
5
8
6
3
7
r
7
8
res=0
Step 1 / 10
Step 1:
Initialize pointers l=0, r=8. Max area res=0.
Pointers: l=0, r=8
Focus: select @ [0, 8]
res=0