# 11. 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.

给定n个非负整数a 1, 2，…其中每个表示坐标点(i, ai)。

public int maxArea(int[] height) {
int result = 0;
for (int i = 0; i < height.length; i++) {
for (int j = height.length - 1; j >= 0; j--) {
int temp = (j - i) * Math.min(height[i], height[j]);
result = Math.max(result, temp);
}
}
return result;
}

Submission Result: Time Limit Exceeded

public int maxArea(int[] height) {
int i =0, j = height.length - 1;
int result = 0;
while (i != j){
int temp = (j - i) * Math.min(height[i], height[j]);
result = Math.max(result, temp);
if (height[i] > height[j])
j--;
else
i++;
}
return result;
}