LeetCode 刷题记录: 11. Container With Most Water [Python]

原题

https://leetcode.com/problems/container-with-most-water/

Given n non-negative integers a1, a2, …, an , where each represents a point at coordinate (i, ai). nvertical 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.

思路

贪心算法，从左右两边开始，从短的一边往中间缩进并记录最大值。由于短板效应从短的一边往中间缩进是最有利的。

代码

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

# Greedy, LeetCode

支付宝

微信

Paypal Buy me a coffee

LeetCode 刷题记录: 11. Container With Most Water [Python]

原题

思路

代码

喜欢这篇文章？打赏一下作者吧

评论

分类

标签

最新文章

归档

最新文章

归档

Your browser is out-of-date!