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.

求容器的最大面积，通过遍历，将每个的（right-left）*height与最大面积比较。

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