首页 > 代码库 > [leetcode]Container With Most Water @ Python
[leetcode]Container With Most Water @ Python
原题地址:https://oj.leetcode.com/problems/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.
解题思路:两个隔板的矮的那一个的高度乘以两个隔板的间距就是储水量。
代码:
class Solution: # @return an integer def maxArea(self, height): left = 0; right = len(height)-1 res = 0 while left < right: water = min(height[left], height[right]) * (right-left) if water > res: res = water if height[left] < height[right]: left += 1 else: right -= 1 return res
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。