Type：medium
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.
Example:
Input:[1,8,6,2,5,4,8,3,7]Output:49
水箱问题，给定一个vector数组，按顺序将其数值画在坐标轴上。取其中两个值的大小做水箱侧边，x轴为水箱底，使得水箱容量最大。
本题使用暴力遍历做法，水箱高度为两个值中略小的值，长度为两个值在数组中的距离。程序运行时间比平均题解略久，但消耗内存小于99.72%题解。
class Solution {
public:
int maxArea(vector<int>& height) {
int max_area = 0;
int n = height.size();
for(int i=0; i<n; i++){
for(int j=i+1; j<n; j++){
int temp = (j-i)*(min(height[i], height[j]));
if(temp > max_area) max_area = temp;
}
}
return max_area;
}
};
