11. Container With Most Water

[fockspaces]

1. l, r 雙指針
2. 從最外圍開始算，每次都往較低的牆內縮一格

class Solution:
    def maxArea(self, height: List[int]) -> int:
        l, r, ans = 0, len(height) - 1, 0
        while l < r:
            width = r - l
            cup_height = min(height[r], height[l])
            ans = max(ans, cup_height * width)
            if height[l] < height[r]:
                l += 1
            else:
                r -= 1
        return ans

[fockspaces]

greedy + two pointers: determine the searching direction, update ans in each iteration.

class Solution:
    def maxArea(self, height: List[int]) -> int:
        l, r = 0, len(height) - 1
        ans = 0
        while l < r:
            amount = (r - l) * min(height[l], height[r])
            ans = max(ans, amount)
            if height[l] < height[r]:
                l += 1
            else:
                r -= 1
        return ans