原题链接 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.

Example:

Input: [1,8,6,2,5,4,8,3,7]
Output: 49

用两个指针直接对其扫描，在扫描的过程中进行计算最多的水的容量，找左右两边尽量高的水柱进行计算。
class Solution {
public:
    int maxArea(vector<int>& height) {
        int len = height.size();
        int L = 0, R = len-1;
        int m = 0;
        while(L < R){
            m = max(m, min(height[L],height[R])*(R-L));
            height[L] > height[R] ? R-- : L++;
        }
        return m;
    }
};