[Leetcode] 11. Container With Most Water

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

        while left <= right:
            area = (right - left) * min(height[right], height[left])
            result = max(result, area)
            if height[right] < height[left]:
                right -= 1
            else:
                left += 1

        return result