Container With Most Water

Container With Most Water

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: Lines at index 1 (height 8) and index 8 (height 7).
Area = min(8, 7) * (8 - 1) = 7 * 7 = 49.

Example 2:

Input: height = [1, 1]
Output: 1
Explanation: Area = min(1, 1) * (1 - 0) = 1.

Example 3:

Input: height = [4, 3, 2, 1, 4]
Output: 16
Explanation: Lines at index 0 (height 4) and index 4 (height 4).
Area = min(4, 4) * (4 - 0) = 16.

Constraints

• 2 <= height.length <= 10^5
• 0 <= height[i] <= 10^4

Expected Complexity

• Time: O(n)
• Space: O(1)