LeetCode - 11. Container With Most Water

Medium, 그리디

RunTime : 526 ms / Memory : 29.52 MB

문제

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.

풀이

• 몇 번 풀어본 유형 문제
• 늘 start, end 땡기는 게 헷갈린다.

class Solution:
    def maxArea(self, height: List[int]) -> int:
        start = 0
        end = len(height) - 1

        res = 0
        while start < end:
            current = min(height[start], height[end]) * (end - start)
            res = max(res, current)

            if height[start] < height[end]:
                start += 1
            else:
                end -= 1
        
        return res