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.

设置数组两端两个指针，每次计算完当前最大面积后，将较小的那一段的指针向中间移动一次。

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