LeetCode-11.最大容器问题

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 linei 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.

大致意思就是，找到一组线段中，最合适的两条线段，使得它俩和X轴组成的桶子能装最多的水。