11. Container With Most Water

最新推荐文章于 2022-03-26 22:15:02 发布

night李

最新推荐文章于 2022-03-26 22:15:02 发布

阅读量303

点赞数

CC 4.0 BY-SA版权

分类专栏： leetcode 文章标签： leetcode

本文链接：https://blog.youkuaiyun.com/qq_25819827/article/details/87991607

leetcode 专栏收录该内容

6 篇文章

订阅专栏

本文探讨了如何在给定的垂直线数组中找到能够盛放最多水的两条线段，形成一个容器的问题。通过使用双指针技术，从两端向中间逼近，实现了O(n)的时间复杂度，有效地解决了LeetCode上的经典算法题。

摘要生成于 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:
    def maxArea(self, height: List[int]) -> int:
        size = 0
        start = 0
        end = len(height) -1
        while start<end:
            temp = min(height[start],height[end]) * (end-start)
            size = max(size,temp)
            if height[start] > height[end]:
                end-=1
            else:
                start+=1
        return area