LeetCode-11 Container With Most Water

最新推荐文章于 2024-11-07 23:24:07 发布

温暖℡

最新推荐文章于 2024-11-07 23:24:07 发布

阅读量100

点赞数

文章标签： leetcode 指针

本文链接：https://blog.csdn.net/weixin_41875619/article/details/104381051

版权

Description

Given n non-negative integers a₁, a₂, …, a_n , where each represents a point at coordinate (i, a_i). n vertical lines are drawn such that the two endpoints of line i is at (i, a_i) 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

Submissions

本题的解题思路是定义两个指针,初始分别指向数组的左端和右端,maxA存储每次面积的最大值.当左指针值小于右指针值时,面积等于左指针值乘中间距离,左指针向右移,当右指针值小于左指针值时,面积等于右指针值乘中间距离,右指针向左移.最后返回maxA.

实现代码如下:

class Solution:
    def maxArea(self, height: List[int]) -> int:
        maxA = 0
        l = 0
        r = len(height)-1
        while l < r:
            if height[l] < height[r]:
                maxA = max(maxA , height[l]*(r-l))
                l += 1
            else:
                maxA = max(maxA , height[r]*(r-l))
                r -= 1
        return maxA