Container_with_most_water.py

"""11. Container With Most Water
Medium

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 the line i is at (i, ai) and (i, 0). Find two lines, which, together with the x-axis forms a container, such that the container contains the most water.

Notice that you may not slant the container.



Example 1:

Input: height = [1,8,6,2,5,4,8,3,7]
Output: 49
Explanation: 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 2:

Input: height = [1,1]
Output: 1

Example 3:

Input: height = [4,3,2,1,4]
Output: 16

Example 4:

Input: height = [1,2,1]
Output: 2
"""

from timeit import timeit

a = [1,8,6,2,5,4,8,3,7]

def maxArea(a):
    MaximumArea = 0
    for start_index, start_num in enumerate(a[:len(a)-1]):
        higher_end_num = 0

        for end_index, end_num in enumerate(a[::-1]):
            end_index = (len(a)-1)-end_index
            if start_num <= end_num:
                area = (end_index - start_index) * start_num
                if area > MaximumArea:
                    MaximumArea = area

                break
            else:
                if end_num > higher_end_num:
                    higher_end_num = end_num
                    area = (end_index - start_index) * min(start_num, end_num)
                    if area > MaximumArea:
                        MaximumArea = area
    print(MaximumArea)
    return MaximumArea


maxArea(a)