11. Container With Most Water leetcode Python 2016 new Season

hyperbolechi

于 2016-01-05 11:15:33 发布

阅读量328

点赞数

CC 4.0 BY-SA版权

分类专栏： leetcode 2016刷题

本文链接：https://blog.youkuaiyun.com/hyperbolechi/article/details/50461151

leetcode 同时被 2 个专栏收录

166 篇文章

订阅专栏

2016刷题

45 篇文章

订阅专栏

本文介绍了一种利用双指针优化O(n)时间复杂度和O(1)空间复杂度解决容器最大容量问题的方法。通过从两端向中间遍历数组，不断更新最大容量值，最终找到最优解。

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

Show Company Tags

Show Tags

Show Similar Problems

we need at least linear time to go through the whole array. do search from both sides and compare max water each time. o(n) time o(1) space.

class Solution(object):
    def maxArea(self, height):
        """
        :type height: List[int]
        :rtype: int
        """
        left_index = 0
        right_index = len(height) - 1
        result = 0
        while left_index < right_index:
            water = min(height[left_index], height[right_index]) * (right_index - left_index)
            if water > result:
                result = water
            if height[left_index] <= height[right_index]:
                left_index += 1
            else:
                right_index -= 1
        return result