leetcode 11 Container With Most Water

最新推荐文章于 2024-10-07 11:40:27 发布

原创最新推荐文章于 2024-10-07 11:40:27 发布 · 330 阅读

0 ·

CC 4.0 BY-SA版权

leetcode 专栏收录该内容

28 篇文章

订阅专栏

本文介绍了一个经典的算法问题：给定一系列垂直线，每条线由坐标(i, ai)定义，目标是找出两条线，这两条线与x轴形成的容器能够容纳最多的水。文章提供了一种有效的解决方案，并通过代码示例展示了如何实现。

Container With Most Water

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):
        j=len(height)-1
        i=0
        ans=0
        while i<j:
            area=(j-i)*min(height[i],height[j])
            if ans<area:
                ans=area
            if height[i]<=height[j]:
                i+=1
            else:
                j-=1
        return ans

这个怎么证明其正确性？