leetcode盛最多水的容器

原题：https://leetcode-cn.com/problems/container-with-most-water/

利用双指针进行求解的，这样时间复杂度比较低为O(n)

class Solution(object):
    def maxArea(self, height):
        """
        :type height: List[int]
        :rtype: int
        """
        i = 0
        j = len(height)-1
        water = 0
        while i<j:
            water = max(water,(j-i)*min(height[i],height[j]))
            if height[i]<height[j]:
                i+=1
            else:
                j-=1
        return water