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.

解题思路：

• 需要考虑到一点，一个vertical line比另外一个vertical line长的话，至少要1！！！所以移动较短的指针一次也是距离变化1，起码可以保证新面积不会变小。
• 基本的细想都是遍历！！！
• 示意图

代码：

class Solution(object):
    def maxAreatwo(self, height):

        max_area, i, j = 0, 0, len(height) - 1
        while i < j:
            max_area = max(max_area, min(height[i], height[j]) * (j - i))
            if height[i] < height[j]:
                i += 1
            else:
                j -= 1
        return max_area


if __name__ == "__main__":
    height = [1, 2, 1, 4, 1, 5, 1]
    result = Solution().maxAreatwo(height)
    print(result)