0011. Container With Most Water

"""You are given an integer array height of length n. 
There are n vertical lines drawn such that the two endpoints of the ith line are (i, 0) and (i, height[i]).
Find two lines that together with the x-axis form a container, such that the container contains the most water.
Return the maximum amount of water a container can store.
Notice that you may not slant the container."""

class Solution: # O(n) O(1)
    def maxArea(self,height):
        max_area = 0
        l = 0
        r = len(height) - 1
        while (l < r):
            curr_water_area = min(height[l], height[r]) * (r - l) 
            max_area = max(max_area, curr_water_area)
            # 谁矮谁移动, 长的移动就会越移越小
            if (height[l] < height[r]): 
                l += 1
            else:
                r -= 1
        return max_area