[leetcode]Container With Most Water @ Python
浏览数：67 /
时间：2015年06月08日
原题地址：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
[leetcode]Container With Most Water @ Python,古老的榕树,5-wow.com
郑重声明：本站内容如果来自互联网及其他传播媒体，其版权均属原媒体及文章作者所有。转载目的在于传递更多信息及用于网络分享，并不代表本站赞同其观点和对其真实性负责，也不构成任何其他建议。
