Container With Most Water

Medium~20 min

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.

Note: You may not slant the container.

Examples

Example 1

Input: height = [1,8,6,2,5,4,8,3,7]

Output: 49

Explanation: The max area is between the lines at index 1 (height 8) and index 8 (height 7). Area = min(8, 7) * (8 - 1) = 49.

Example 2

Input: height = [1,1]

Output: 1

Explanation: The only container is between the two lines. Area = min(1, 1) * (1 - 0) = 1.

Constraints

n == height.length
2 <= n <= 10^5
0 <= height[i] <= 10^4
Expected time complexity: O(n)

Code

Ctrl+EnterRun|Ctrl+⇧+EnterSubmit

Output

Run your code to see results

Use Cmd+Enter to run