#11 Container With Most Water

熊怪要变码农啦

已于 2022-02-20 21:43:39 修改

阅读量283

点赞数

于 2022-02-20 21:41:17 首次发布

本文链接：https://blog.csdn.net/yzh3558/article/details/123036534

版权

LeetCode Hot 专栏收录该内容

4 篇文章 0 订阅

订阅专栏

You are given an integer array height of length n. There are n vertical lines drawn such that the two endpoints of the ith line are (i, 0)and (i, height[i]).

Find two lines that together with the x-axis form a container, such that the container contains the most water.

Return the maximum amount of water a container can store.

Notice that you may not slant the container.

class Solution:
    def maxArea(self, height):

        left, right = 0, len(height) - 1
        res = 0

        while left < right:
            # start from the longest width
            temp = min(height[left], height[right]) * (right - left)
            res = max(res, temp)

            # looking for a taller container
            if height[left] < height[right]:
                left += 1
            else:
                right -= 1

        return res