leecode 11. Container With Most Water

11. Container With Most Water

Given n non-negative integers a1, a2, …, an , where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of line i is at (i, ai) and (i, 0). Find two lines, which together with x-axis forms a container, such that the container contains the most water.

Note: You may not slant the container and n is at least 2
图片:
Example:

Input: [1,8,6,2,5,4,8,3,7]
Output: 49

class Solution:
    def maxArea(self, height: List[int]) -> int:
    	#res 存储面经，l左边下标，r右边下标
        res, l, r = 0, 0, len(height) - 1
        while l < r: 
        	#右边高，面积=height[l] x (r - l)，l+=1
        	#左边高，面积=height[r] x (r - l)，r-=1
            res, l, r = (max(res,  height[l] * (r - l)), l + 1, r) if height[l] < height[r] else (max(res,  height[r] * (r - l)), l, r - 1)
        return res