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.

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

Ref：
1、https://leetcode.com/problems/container-with-most-water/description/
2、https://leetcode.com/problems/container-with-most-water/solution/#