【LeetCode】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.

O（n*n）的方法显而易见，但是会TLE，需要找O（n）的方法。

解法：low初始为数组最左端（即为0），high初始为最右端（即size-1），然后往中间缩进。若 low<high 则low++，因为容器大小是由短板决定的，若low不变，容器只会小于等于之前的大小。low>=high时一样。

代码如下：

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