leetcode 11 Container With Most Water

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

ghoshorn

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

阅读量301

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/ghoshorn/article/details/44923511

版权

leetcode 专栏收录该内容

28 篇文章 0 订阅

订阅专栏

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

这个怎么证明其正确性？