leetcode 【 Container With Most Water 】python 实现

提示：扫一扫查出行
【扫一扫了解最新限行尾号】
复制提示

题目：

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.

代码：oj测试通过 Runtime: 132 ms

 class Solution:

     # @return an integer

     def maxArea(self, height):

         # none case or one element case

         if height is None or len(height)<2:

             return 0

         # left point and right point

         left = 0

         right = len(height)-1

         max_container = 0

         while left<right :

             curr_container = min(height[left],height[right]) * (right-left)

             max_container = max(curr_container,max_container)

             if height[left]>height[right]:

                 right = right-1

             else:

                 left = left+1

         return max_container