Leetcode Container With Most Water

题意：找到蓄水量最大的容器。

思路：从两边开始找，每次更新较小的边。

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