[11] Container With Most Water

https://leetcode.com/problems/container-with-most-water/description/

• algorithms
• Medium (40.35%)
• Source Code: 11.container-with-most-water.py
• Total Accepted: 348.3K
• Total Submissions: 796.6K
• Testcase Example: '[1,8,6,2,5,4,8,3,7]'

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.

The above vertical lines are represented by array [1,8,6,2,5,4,8,3,7]. In this case, the max area of water (blue section) the container can contain is 49.

Example:

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

class Solution(object):
    def maxArea(self, height):
        """
        :type height: List[int]
        :rtype: int
        """
        length = len(height)
        l, r = 0, length - 1
        water = 0
        while l < r:
            area = min(height[l], height[r]) * (r - l)
            if area > water: water = area
            mn = l if height[l] < height[r] else r
            if mn == l:
                l += 1
            else:
                r -= 1
        return water