11. 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 the line i is at (i, ai) and (i, 0). Find two lines, which, together with the x-axis forms a container, such that the container contains the most water.

Notice that you may not slant the container.

 

Example 1:

Input: height = [1,8,6,2,5,4,8,3,7]
Output: 49
Explanation: The above vertical lines are represented by array [1,8,6,2,5,4,8,3,7]. In this case, the max area of water (blue section) the container can contain is 49.

Example 2:

Input: height = [1,1]
Output: 1

Example 3:

Input: height = [4,3,2,1,4]
Output: 16

Example 4:

Input: height = [1,2,1]
Output: 2

 

Constraints:

• n == height.length
• 2 <= n <= 105
• 0 <= height[i] <= 104

解法

解法一：这道题可以用和42. Trapping Rain Water一样的思路来做，O(n)的时间复杂度，代码如下：

    def maxArea(self, height: List[int]) -> int:
        i=0
        j=len(height)-1
        maxarea=0
        while (i<j):
            if(height[i]<=height[j]):
                maxarea=max(maxarea,height[i]*(j-i))
                i+=1
            else:
                maxarea=max(maxarea,height[j]*(j-i))
                j-=1
        return maxarea

解法一代码上可以再简化一些：

    def maxArea(self, height: List[int]) -> int:
        i=0
        j=len(height)-1
        maxarea=0
        while (i<j):
            maxarea=max(maxarea,min(height[i],height[j])*(j-i))
            if(height[i]<=height[j]):
                i+=1
            else:
                j-=1
        return maxarea

解法一的思路上再优化一些，这样执行时间相比第一次的代码，耗时减少了约12%

def maxArea(self, height: List[int]) -> int:
        i=0
        j=len(height)-1
        maxarea=0
        while (i<j):
            h=min(height[i],height[j])
            maxarea=max(maxarea,h*(j-i))
            while(i<j and height[i]<=h):
                i+=1
            while(i<j and height[j]<=h):
                j-=1
        return maxarea

看我的内存使用只处于python中的中间位置，看了几个方法都是这种思路，内存占用并没有比我的低，难度是因为我用了python3吗？先不管了~