Container With Most Water

最新推荐文章于 2024-08-28 08:50:09 发布

原创最新推荐文章于 2024-08-28 08:50:09 发布 · 437 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#max

leetcode 专栏收录该内容

154 篇文章

订阅专栏

本文介绍了一个经典的算法问题：给定一系列高度，如何找到两个高度之间的最大矩形面积。该问题通过双指针技术解决，逐步调整左右边界以寻找最优解。

摘要生成于 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.

class Solution:
    # @return an integer
    def maxArea(self, height):
        ret,left,right=-1,0,len(height)-1
        while left < right:
            ret=max(ret,(right-left)*min(height[left],height[right]))
            if height[left] < height[right]:
                left=left+1
            else:
                right=right-1
        return ret