11. Container With Most Water leetcode Python 2016 new Season

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.

Show Company Tags

Show Tags

Show Similar Problems

we need at least linear time to go through the whole array.  do search from both sides and compare max water each time. o(n) time o(1) space.

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