11. Container With Most Water

最新推荐文章于 2022-07-23 19:08:46 发布

班黑炭

最新推荐文章于 2022-07-23 19:08:46 发布

阅读量105

点赞数

CC 4.0 BY-SA版权

本文链接：https://blog.youkuaiyun.com/barryzhou/article/details/99554179

本文探讨了如何从一组垂直线中找出两线，与x轴形成的最大盛水容器。通过双指针技巧，实现高效求解。示例输入为[1,8,6,2,5,4,8,3,7]，输出为49，详细介绍了算法原理及代码实现。

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

The above vertical lines are represented by array [1,8,6,2,5,4,8,3,7]. In this case, the max area of water (blue section) the container can contain is 49.

Example:

Input: [1,8,6,2,5,4,8,3,7]
Output: 49

class Solution(object):
    def maxArea(self, height):
        """
        :type height: List[int]
        :rtype: int
        """
        s = -1
        for i in range(len(height)):
            for j in range(i+1,len(height)):
                hi = height[i]
                hj = height[j]
                if self.area(hi,i,hj,j)>s:
                    s=self.area(hi,i,hj,j)
        return s
    
    def area(self,x,i,y,j):
        if x<y:
            return x*(j-i)
        else:
            return y*(j-i)