[leetcode] 11. Container With Most Water _ Algorithm Problem Solve for python

1. Problem

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 <= 10^5
• 0 <= height[i] <= 10^4

2. Solution

I solved this problem like this.

• Make left, right index cursor. Check left & right min height. Confirm height * weight value and renew answer.
• After that, move cursor that height is smaller than other cursor.
class Solution:
def maxArea(self, height: List[int]) -> int:
left, right = 0, len(height) - 1
ans = 0
while left < right:
h = min(height[left], height[right])
ans = max(ans, h * (right - left))
if height[left] < height[right]:
left += 1
else:
right -= 1

return ans