首页 > 代码库 > 11. Container With Most Water
11. Container With Most Water
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.
class Solution(object): def maxArea(self, height): """ :type height: List[int] :rtype: int """ fir = 0 last = len(height)-1 max_area = 0 while fir<last: max_area=max(max_area,min(height[fir],height[last])*(last-fir)) if height[fir]>height[last]: last=last-1 else: fir=fir+1 return max_area
11. Container With Most Water
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。