11. Container With Most Water: Two Pointers: revisit

 1class Solution:
 2    def maxArea(self, height: List[int]) -> int:
 3        n = len(height)
 4        l, r = 0, n - 1
 5        max_amount = 0
 6
 7        while l < r:
 8            max_amount = max(max_amount, min(height[l], height[r]) * (r - l))
 9            if height[l] < height[r]:
10                l += 1
11            else:
12                r -= 1
13
14        return max_amount