[Leetcode]Container With Most Water

原创于 2018-04-21 22:24:20 发布 · 196 阅读

CC 4.0 BY-SA版权

本文介绍了一个经典的算法问题——寻找能形成最大容器面积的两条线段。通过双指针技巧，从两端逐步向中间逼近，实现了O(n)的时间复杂度。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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.

思路：最大面积由最小的柱子决定，因此这里设置左右两个标记，向中间靠拢，程序简单易懂。时间复杂度O(n)

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