leetcode：11. Container with the most water [double pointer + greed + remove the shortest board]

analysis

At first, the double pointer points to one end
Then see which one is smaller , Just move it to the middle （ The purpose of this is to remove the shortest board , It is possible to get bigger ）

ac code

class Solution:
    def maxArea(self, height: List[int]) -> int:
        # double pointers
        n = len(height)
        l, r = 0, n - 1
        ans = 0

        while l < r:
            ans = max(ans, min(height[l], height[r]) * (r - l))
            #  greedy ： Remove the shortest board 
            if height[l] < height[r]:
                l += 1
            else:
                r -= 1
        
        return ans

summary

Double pointer greedy to remove the shortest board