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.

example1:

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.

투포인터를 써서 하는 거는 알았는데 이걸 어떻게 하는 건가 싶었는데 말 그대로 while 루프를 사용해서 각 포인터에서 넓이를 계산해서 그 중에 가장 큰 넓이를 갖고 있는 걸 계산하는 거였다.

class Solution:
    def maxArea(self, height: List[int]) -> int:
        n = len(height) # the number of heights
        left = 0
        right = len(height) - 1
        max_area = 0

        while left < right:
            width = right - left
            h = min(height[left], height[right])
            current_area = width * h
            max_area = max(max_area, current_area)

            if height[left] < height[right]:
                left += 1
            else:
                right -= 1

        return max_area

        # Time O(n)
        # Space O(1)