LeetCode_container-with-most-water

链接：https://www.nowcoder.com/PRactice/c97c1400a425438fb130f54fdcef0c57?tpId=46&tqId=29167&tPage=1&rp=1&ru=/ta/leetcode&qru=/ta/leetcode/question-ranking 来源：牛客网

题目描述： 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.

题意理解： 有若干块木板位于坐标系中，找到两块与坐标系构成最大的面积。

解题思路： 最好的情况是最长的两块木板位于最外两端，那么很容易想到用两个指针分别指向数组两端，每次保留较长的木板，另一端靠近。