11【Leetcode】 Container With Most Water

来源:互联网 发布:c语言随机数 编辑:程序博客网 时间:2024/06/03 17:02

Given n non-negative integers a1a2, ..., an, where each represents a point at coordinate (iai). n vertical lines are drawn such that the two endpoints of line i is at (iai) 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):        if len(height)<2:            return 0        else:            i = 0            j = len(height)-1            maxlen = (j-i)*min(height[i],height[j])            while(i!=j):                maxlen = max(maxlen,(j-i)*min(height[i],height[j]))                if height[j]>height[i]:                    i+=1                else:                    j-=1            return maxlen


原创粉丝点击