LeetCode: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.

The above vertical lines are represented by array [1,8,6,2,5,4,8,3,7].
In this case, the max area of water (blue section) the container can
contain is 49.

首先说一句，这题和84题（https://blog.csdn.net/weixin_43462819/article/details/84138770 ）有很相似的地方，可以自己比较一下这两题的异同。

解法来源：
https://leetcode.com/problems/container-with-most-water/discuss/6100/Simple-and-clear-proofexplanation
一个对该解法更好的解释：
https://leetcode.com/problems/container-with-most-water/discuss/6099/Yet-another-way-to-see-what-happens-in-the-O(n)-algorithm

具体做法：取最左边和最右边为水箱高度，计算出容水量。因为其他的水箱高度都要比它小，所以至少高度要比它高。要想高度比它高，至少不能在以它们两个中较矮的那个为高了，所以将他俩中较矮的那个往中间移动，反复计算。
上面的那个解释的链接里面非常形象化地将该过程描述了出来，值得看看。

代码：

class Solution {
public:
    int maxArea(vector<int>& height) {
        if (height.empty()) return 0;
        int left = 0, right = height.size()-1;
        int water = 0;
        while (left < right) {
            water = max(water, (right-left)*min(height[left], height[right]));
            if (height[left] < height[right])
                ++left;
            else
                --right;
        }
        return water;
    }
};