11. Container With Most Water

11

Container With Most Water Medium

Tags: Array, Greedy, Two Pointers

Solución (Python)

class Solution(object):
    def maxArea(self, height):
        left_index = 0
        right_index = len(height) - 1
        max_area = 0

        while left_index < right_index:
            width = right_index - left_index
            left_height = height[left_index]
            right_height = height[right_index]

            min_height = min(left_height, right_height)     #same min area and max of the prev code
            area = width * min_height
            max_area = max(area, max_area)

            if left_height <= right_height: #this moves the pointer w a small height
                left_index += 1
            else:
                right_index -= 1

        return max_area

sol = Solution()
print(sol.maxArea([1,8,6,2,5,4,8,3,7]))
print(sol.maxArea([1,1]))

Anterior Siguiente