[LeetCode] 11. Container With Most Water

class Solution:
    def maxArea(self, height: List[int]) -> int:
        ret = 0
        n = len(height)
        
        left = 0
        right = n - 1
        
        while (left < right):
            
            ret = max(ret, min(height[left], height[right]) * (right - left))
            
            if (height[left] <= height[right]):
                left += 1
            else:
                right -= 1
        return ret

O(N)

two pointer