码迷,mamicode.com
首页 > 其他好文 > 详细

11. Container With Most Water

时间:2017-01-10 13:18:57      阅读:153      评论:0      收藏:0      [点我收藏+]

标签:log   bsp   style   turn   with   int   ica   nes   res   

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):
        """
        :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

标签:log   bsp   style   turn   with   int   ica   nes   res   

原文地址:http://www.cnblogs.com/rocksolid/p/6268790.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!