Container With Most Water — LC Medium

11. 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.

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.

Example 2:

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

Constraints:

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

class Solution:
    def maxArea(self, height: List[int]) -> int:
        left, right = 0, len(height) - 1
        maxVol = 0
        curMax = 0
        while left < right:
            x_dist = right - left
            
            if height[right] > height[left]:
                curMax = height[left]*x_dist
                # move the left pointer
                left += 1
            else:
                curMax = height[right]*x_dist
                right -= 1
                
            maxVol = max(maxVol, curMax)
        return maxVol