Container With Most Water (in Python)

Problem

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, O). 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

Solution

• To maximize the Area that can be formed between the vertical lines using the shorter line as length and the distance between the lines as the width of the rectangle forming the area.

class Solution:
    def maxArea(self, height):
        """
        :type height: List[int]
        :rtype: int
        """
        
        left, right, y = 0, len(height)-1, 0
        max_water = 0
 
        while left < right :
 
            x = (j-i)
 
            if height[left]<=height[right] :
                y = height[left]
                left+=1
            else :
                y = height[right]
                right -= 1
            
            max_water = max(x * y, ans)
 
        return ans