leetcode记录11.Container With Most Water

最新推荐文章于 2024-10-29 13:54:07 发布

原创最新推荐文章于 2024-10-29 13:54:07 发布 · 171 阅读

0 ·

CC 4.0 BY-SA版权

leetcode 专栏收录该内容

37 篇文章

订阅专栏

本文详细解析了LeetCode上的第11题——Container With Most Water，介绍了一种求解两个垂直线间最大面积的算法。通过双指针法，逐步调整左右边界，寻找能使容器容纳最多水的两根线段。

leetcode记录11.Container With Most Water

#
# @lc app=leetcode id=11 lang=python3
#
# [11] Container With Most Water
#
# https://leetcode.com/problems/container-with-most-water/description/
#
# algorithms
# Medium (42.80%)
# Total Accepted:    324.5K
# Total Submissions: 758.3K
# Testcase Example:  '[1,8,6,2,5,4,8,3,7]'
#
# 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:
        i = 0
        j = len(height) - 1
        maxA = 0
        while(i < j):
            temp = min(height[i], height[j]) * (j - i)
            if (temp > maxA):
                maxA = temp
            if height[i] < height[j]:
                i = i + 1
            else:
                j = j - 1
        
        return maxA