Day027 - 11. Container With Most Water

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:
        """
        마찬가지로 2-pointer로 O(N)의 탐색시간만을 갖는것이 핵심.
        """
        l = 0
        r = len(height)-1

        max_water = -1
        while l < r:
            current_water = min(height[l], height[r]) * (r - l)
            if current_water > max_water:
                max_water = current_water

            if height[l] < height[r]:
                l += 1
            else:
                r -= 1

        return max_water

주어진 기둥들이 높이를 고려하여 가장 물을 많이 담을 수 있는 두 기둥의 번호를 return하는 문제이다.

# Time Complexity : \(O(N)\)