[勇者闯LeetCode] 11. Container With Most Water

[勇者闯LeetCode] 11. Container With Most Water

Description

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.

Information

• Tags: Array | Two Pointers
• Difficulty: Medium

Solution

用两个指针从两端开始向中间靠拢，如果左边线段短于右边，那么左边指针右移，反之右边指针左移，直到左右指针移到中间重合，记录这个过程中组成木桶的最大容积。

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