思路：两层遍历
public int maxArea(int[] height) {
int maxArea = 0;
for (int i = 0; i < height.length - 1; i++) {
for (int j = i+1; j < height.length; j++) {
int area = (j - i) * Math.min(height[i], height[j]);
maxArea = Math.max(area, maxArea);
}
}
return maxArea;
}