leetcode 11. 盛最多水的容器

思路：
左右两个索引向中间移动即可，小值的索引的向中间移动

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

        return maxarea if maxarea > current else current