LeetCode_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 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 and n is at least 2.

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:

Input: [1,8,6,2,5,4,8,3,7]
Output: 49

代码：

class Solution(object):
    def maxArea(self, height):
        """
        :type height: List[int]
        :rtype: int
        """
        
        result = 0

        left = 0                  #左指针
        right = len(height) -1    #右指针

        while left < right :
            if height[left] <= height[right]:           #更新短的指针的下标
                result = max(result, (right - left)*height[left])
                left += 1
            else :
                result = max(result, (right - left)*height[right])
                right -= 1

        return result