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.

代码：

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